" Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008." Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services,"Įuropean Journal of Operational Research, Elsevier, vol. Derigs, Ulrich & Kurowsky, René & Vogel, Ulrich, 2011.Transportation Research Part B: Methodological, Elsevier, vol. " A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Diana, Marco & Dessouky, Maged M., 2004.Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. " An exact solution approach for vehicle routing and scheduling problems with soft time windows," " A vehicle routing problem with backhauls and time windows: a guided local search solution," Zhong, Yingjie & Cole, Michael H., 2005." An exact algorithm for a single-vehicle routing problem with time windows and multiple routes,"Įuropean Journal of Operational Research, Elsevier, vol. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2007." The split delivery vehicle routing problem with minimum delivery amounts," Gulczynski, Damon & Golden, Bruce & Wasil, Edward, 2010.Extensive experiments are conducted to illustrate the application of the model and demonstrate the cost savings of the MTM-D2PDCA mode over the single-trip mode and provide managerial insights into successfully operating a MTM-D2PDCA service. In addition, we present several mathematical insights into the relationship between the number of trip-chains and the number of local optimal trips that are applicable in both theory and practice. Based on the feasible trip-chains, the MTM-D2PDCA problem is formulated as the novel TCO-SP model, which can be solved exactly by the optimization software CPLEX. In the exact algorithm, we propose an improved label-correcting method to remove infeasible trip-chains quickly and thus speed the search process. To obtain the exact solution of the MTM-D2PDCA problem, we propose a novel, exact algorithm based on the trip-chain-oriented set-partitioning (TCO-SP) model, where a trip-chain represents multiple trips made by a specific vehicle. Compared with the single-trip mode, the multi-trip mode of D2PDCA (MTM-D2PDCA) service can reduce travel distances, the number of vehicles required and the operating cost. This new service provides an attractive alternative way by picking up customer at this/her specified position and at any time he/she preferred and delivering to the airport more conveniently than airport shuttle and thus earn high customer service quality. Door-to-Door service of Pickup and Delivery of Customers to the Airport (D2PDCA) is a new service provided by certain Airline Ticket Sales Agencies (ATSAs) in China.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |