الفهرس 
Title : Solving vehicle routing problem with simultaneous pickup and delivery
CONTENTSOnly 14 pages are availabe for public view
 |  | from | 83 |  |  |
| | | from | 83 | | |
Abstract
A mixed integer linear programing (MILP) model is presented to formulate the vehicle routing problems with simultaneous pickup and delivery soft time window. Taking into consideration that products{u2019} delivery or collecting of end of life (EOL) products are performed simultaneously, also early and late time intervals can be violated (Soft) with considering some penalty costs will be added. This research presents a generalized model to solve the soft time window problems.This generalized model can find feasible solutions for more real life applications. As we find in the real life, restricting with the defined time intervals is not efficient for all customers where delivery or pickup processes is a must even if violating the time limits, with regard to adding a penalty cost. A mathematical model is formulated to solve the proposed model, then a heuristic approach is developed to solve large-scale problems and a simulated annealing metaheuristic-based procedure is developed to obtain high quality solutions for this kind of problems