A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries

Authors:
A. Serdar Tasan;Mitsuo Gen
Affiliations:
Department of Industrial Engineering, Dokuz Eylul University, Izmir, Turkey;Fuzzy Logic Systems Institute (FLSI), Iizuka, Fukuoka, Japan and Hanyang University, Ansan, South Korea
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 3
Cited 4

Network Models and Optimization: Multiobjective Genetic Algorithm Approach

Network Models and Optimization: Multiobjective Genetic Algorithm Approach
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery

Computers and Operations Research
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup

Computers and Operations Research

Comparing Static and Dynamic Policies for Vehicle Routing Problems with Backhauling and Dynamic Customer Demands

International Journal of Applied Logistics
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
Green vehicle routing in urban zones - A neuro-fuzzy approach

Expert Systems with Applications: An International Journal
A Genetic Algorithm-based optimization model for supporting green transportation operations

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The vehicle routing problem with simultaneous pick-up and deliveries, which considers simultaneous distribution and collection of goods to/from customers, is an extension of the capacitated vehicle routing problem. There are various real cases, where fleet of vehicles originated in a depot serves customers with pick-up and deliveries from/to their locations. Increasing importance of reverse logistics activities make it necessary to determine efficient and effective vehicle routes for simultaneous pick-up and delivery activities. The vehicle routing problem with simultaneous pick-up and deliveries is also NP-hard as a capacitated vehicle routing problem and this study proposes a genetic algorithm based approach to this problem. Computational example is presented with parameter settings in order to illustrate the proposed approach. Moreover, performance of the proposed approach is evaluated by solving several test problems.