Combinatorial mathematical model and decision strategy for one-to-one pickup and delivery problem with 3D loading constraints

Author(s):  
Remy Dupas ◽  
Igor Grebennik ◽  
Oleksandr Lytvynenko
Author(s):  
Soojung Jung ◽  
Ali Haghani

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.


2013 ◽  
Vol 27 ◽  
pp. 169-188 ◽  
Author(s):  
Mustafa Şahin ◽  
Gizem Çavuşlar ◽  
Temel Öncan ◽  
Güvenç Şahin ◽  
Dilek Tüzün Aksu

Sign in / Sign up

Export Citation Format

Share Document