A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows

OR Spectrum ◽  
2005 ◽  
Vol 27 (1) ◽  
pp. 21-41 ◽  
Author(s):  
Giselher Pankratz
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Pickup And Delivery ◽  
Delivery Problem ◽  
Pickup And Delivery Problem ◽  
Grouping Genetic Algorithm

Genetic Algorithm for a Pickup and Delivery Problem with Time Windows

2000 ◽  
Vol 1733 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Soojung Jung ◽  
Ali Haghani
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Model ◽  
Exact Solution ◽  
Time Windows ◽  
Combinatorial Problems ◽  
Fixed Cost ◽  
Pickup And Delivery ◽  
Penalty Cost ◽  
Delivery Problem ◽  
Pickup And Delivery Problem

A mathematical model for a multivehicle pickup and delivery problem with time windows is presented, and a genetic algorithm (GA) for solving it is proposed. The mathematical model is formulated as a mixedinteger linear programming problem. The objective of the proposed model is to minimize the total cost, which consists of the fixed cost for the vehicles, the routing cost, and the customer inconvenience cost, which is modeled as a penalty cost for violation of the time windows of each customer. Like other combinatorial problems, solving this pickup and delivery problem is time-consuming, and sometimes it is impossible to find an exact solution. The problem is solved exactly for up to six demands (12 nodes), and GA is used for larger problems with more than six demands. The proposed GA can solve a pickup and delivery problem in an extremely short time compared with the exact solution procedure. It also produces excellent results for small problems. A GA used to solve a 30-demands problem (60 nodes) with 10 vehicles is illustrated.

scholarly journals Genetic Algorithm for Mulicriteria Optimization of a Multi-Pickup and Delivery Problem with Time Windows

2009 ◽  
Vol 42 (4) ◽  
pp. 1538-1543 ◽  
Author(s):  
I. Harbaoui Dridi ◽  
R. Kammarti ◽  
M. Ksouri ◽  
P. Borne
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Pickup And Delivery ◽  
Delivery Problem ◽  
Pickup And Delivery Problem

scholarly journals Multi-Objective Optimization for the m-PDPTW: Aggregation Method With Use of Genetic Algorithm and Lower Bounds

2011 ◽  
Vol 6 (2) ◽  
pp. 246 ◽  
Author(s):  
Imen Harbaoui Dridi ◽  
Ryan Kammarti ◽  
Mekki Ksouri ◽  
Pierre Borne
Keyword(s):  
Genetic Algorithm ◽  
Lower Bounds ◽  
Time Windows ◽  
Pickup And Delivery ◽  
Multi Objective Optimization ◽  
Aggregation Method ◽  
Routing Problem ◽  
Delivery Problem ◽  
Multi Objective ◽  
Pickup And Delivery Problem

<p>The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers in purpose to satisfy precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a multi pickup and delivery problem with time windows (m-PDPTW), based on aggregation method and lower bounds. We propose in this sense a brief literature review of the PDPTW, present our approach to give a satisfying solution to the m-PDPTW minimizing the compromise between total travel cost and total tardiness time.</p>

Sign in / Sign up

Export Citation Format

Share Document