scholarly journals Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows

2005 ◽  
pp. 78-89 ◽  
Author(s):  
Herman Sontrop ◽  
Pieter van der Horn ◽  
Marc Uetz
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Ejection Chain

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

scholarly journals A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location

Networks ◽  
2021 ◽  
Author(s):  
Paula Fermín Cueto ◽  
Ivona Gjeroska ◽  
Albert Solà Vilalta ◽  
Miguel F. Anjos
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Solution Approach ◽  
Fleet Sizing

scholarly journals The last-mile vehicle routing problem with delivery options

OR Spectrum ◽  
2021 ◽  
Author(s):  
Christian Tilk ◽  
Katharina Olkis ◽  
Stefan Irnich
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Constraints ◽  
Time Window ◽  
Time Windows ◽  
Service Level ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Common Location ◽  
Delivery Options

AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations.

scholarly journals A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shifeng Chen ◽  
Rong Chen ◽  
Jian Gao
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.

scholarly journals Self-imposed time windows in vehicle routing problems

OR Spectrum ◽  
2013 ◽  
Vol 37 (2) ◽  
pp. 331-352 ◽  
Author(s):  
Ola Jabali ◽  
Roel Leus ◽  
Tom Van Woensel ◽  
Ton de Kok
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Vehicle Routing Problems ◽  
Routing Problems
Sign in / Sign up

Export Citation Format

Share Document