Loading...
Please wait, while we are loading the content...
Similar Documents
An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
| Content Provider | Semantic Scholar |
|---|---|
| Author | Majid, Yousefikhoshbakht Farzad, Didehvar Farhad, Rahmati |
| Copyright Year | 2012 |
| Abstract | The vehicle routing problem with simultaneous picku p and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous f leet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, prac tical large-scale instances of VRPSPD cannot be solved by exact solution methodolo gies within acceptable computational time. Our interest was therefore focu sed on meta-heuristic solution approaches. For this reason, a modified tabu search (PA) is proposed for solving the VRPSPD in this paper. tComputational results on several standard instances of VRPSPD show the efficiency of the PA compared with other meta-heuristic algorithms. |
| Starting Page | 55 |
| Ending Page | 66 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| Volume Number | 3 |
| Alternate Webpage(s) | http://www.sid.ir/en/VEWSSID/J_pdf/1035220120406.pdf |
| Alternate Webpage(s) | http://jacr.iausari.ac.ir/pdf_2506_56653b19910b3e1a0bcf2aa8122df82c.html |
| Alternate Webpage(s) | http://journals.iau.ir/article_631514_56653b19910b3e1a0bcf2aa8122df82c.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |