A genetic algorithm for the simultaneous delivery and pickup problems with time window

Authors:
Hsiao-Fan Wang;Ying-Yen Chen
Affiliations:
Department of Industrial Engineering and Engineering Management, National Tsing Hua University, No. 101, Section 2 Kuang Fu Road, Hsinchu 30013, Taiwan;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, No. 101, Section 2 Kuang Fu Road, Hsinchu 30013, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 12
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Metaheuristics for the capacitated VRP

The vehicle routing problem
VRP with Time Windows

The vehicle routing problem
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

Journal of Heuristics
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

Transportation Science
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery

Computers and Operations Research
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research

Evolutionary approach in inventory routing problem

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper concerns a Simultaneous Delivery and Pickup Problem with Time Windows (SDPPTW). A mixed binary integer programming model was developed for the problem and was validated. Due to its NP nature, a co-evolution genetic algorithm with variants of the cheapest insertion method was proposed to speed up the solution procedure. Since there were no existing benchmarks, this study generated some test problems which revised from the well-known Solomon's benchmark for Vehicle Routing Problem with Time Windows (VRPTW). From the comparison with the results of Cplex software and the basic genetic algorithm, the proposed algorithm showed that it can provide better solutions within a comparatively shorter period of time.