Journal ArticleDOI
Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
TLDR
In this article, the authors formulated the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem and developed a hybrid heuristic algorithm to solve this problem.Abstract:
The vehicle routing problem with simultaneous deliveries and pickups (VRPSDP) has attracted much research interest because of the potential to provide cost savings to transportation and logistics operators. Several extensions of VRPSDP exist. Of these extensions, the simultaneous deliveries and pickups with split loads problem (SDPSLP) has been proposed to eliminate vehicle capacity constraints, as well as allow the deliveries or pickups for a customer to be split into multiple visits. Although delivery and pickup activities are often constrained by time windows, few studies have considered such constraints when SDPSLP has been addressed. To fill the gap, this paper formulates the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem. A hybrid heuristic algorithm was developed to solve this problem. Solomon data sets with minor modifications were applied to test the effectiveness of the solution algorithm. The r...read more
Citations
More filters
Demand-Responsive Transport: Models and Algorithms
TL;DR: In this article, the authors present mathematical models for demand-responsive transport and methods that can be used to solve combinatorial problems related to vehicle routing and journey planning in a transport network.
Journal ArticleDOI
Reduction of CO2 Emissions in Cumulative Multi-Trip Vehicle Routing Problems with Limited Duration
TL;DR: In this paper, a cumulative multi-trip vehicle routing problem with limited duration (CumMTVRP-LD) is modelled by taking into account the reduction of CO 2 emissions.
Journal ArticleDOI
A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
M. Burger,Zhou Su,B. De Schutter +2 more
TL;DR: This paper proposes a novel formulation for the fixed-destination, multi-depot travelling salesman problem, where several salesmen will start from different depots, and they are required to return to the depot they originated from.
Journal ArticleDOI
An Exact Algorithm for a Fuel-Constrained Autonomous Vehicle Path Planning Problem
TL;DR: This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations with four new mixed-integer linear programming formulations for the problem and presents a branch-and-cut algorithm developed to compute an optimal solution.
Journal ArticleDOI
Intelligent Taxi Dispatch System for Advance Reservations
TL;DR: The strategy proposed has the poten tial to lower the taxi reservation fee in Singapore to encourage advance reservations that facilitate trip chaining, which translates to lower taxi fares for customers, higher revenue for taxi drivers, and lower fleet ownership cost for taxi companies.
References
More filters
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.
Journal ArticleDOI
Savings by Split Delivery Routing
Moshe Dror,Pierre Trudeau +1 more
TL;DR: This paper examines a relaxed version of the generic vehicle routing problem, in which a delivery to a demand point can be split between any number of vehicles, and demonstrates the potential for cost savings through split deliveries.
Journal ArticleDOI
Solving the pickup and delivery problem with time windows using reactive tabu search
William P Nanry,J. Wesley Barnes +1 more
TL;DR: In this article, a reactive tabu search approach is proposed to solve the pickup and delivery problem with time windows using three distinct move neighborhoods that capitalize on the dominance of the precedence and coupling constraints.