Single-Commodity Vehicle Routing Problem with Pick-up and Delivery Service (CROSBI ID 146440)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Martinović, Goran ; Aleksi, Ivan ; Baumgartner, Alfonzo
engleski
Single-Commodity Vehicle Routing Problem with Pick-up and Delivery Service
We present a novel variation of the vehicle routing problem (VRP). Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD). 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP) when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is NP hard in the strong sense. Iterative modified simulated annealing (IMSA) is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.
iterative modified simulated annealing; pick-up and delivery service; single commodity; vehicle routing
Article ID: 697981
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
2008
2008.
697981-1-697981-17
objavljeno
1024-123X
10.1155/2008/697981