A model with a heuristic algorithm for solving the long-term many-to-many car pooling problem

IEEE Transactions on Intelligent Transportation Systems

Volumn 12, Issue 4, 2011, Pages 1362-1373

  Yan, Shangyao ^a   Chen, Chun Ying ^a   Lin, Yu Fang ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b THI Consultants Inc   (Taiwan)

Author keywords

Lagrangian relaxation; many to many car pooling problem; multiple commodity network flow problem; network

Indexed keywords

CAR POOLING; LAGRANGIAN; LAGRANGIAN RELAXATION; MULTIPLE COMMODITY NETWORK FLOW PROBLEM; NETWORK FLOW PROBLEMS; NETWORK FLOW TECHNIQUES; ORIGIN AND DESTINATIONS; PRIVATE VEHICLES;

HEURISTIC ALGORITHMS; LAGRANGE MULTIPLIERS; NETWORKS (CIRCUITS);

MATHEMATICAL MODELS;

EID: 82455167872     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2011.2158209     Document Type: Article

References (28)

1. R. Baldacci, V. Maniezzo, and A. Mingozzi, "An exact method for the car pooling problem based on Lagrangian column generation,"Oper. Res., vol. 52, no. 3, pp. 422-439, Jun. 2004.
2. P. K. Camerini, L. Fratta, and F. Maffioli, "On improving relaxation methods by modified gradient techniques,"Math. Program. Study, vol. 3, pp. 26-34, 1975.
3. A. Colorni and G. Righini, "Modeling and optimizing dynamic dial-A-ride problems,"Int. Trans. Oper. Res., vol. 8, no. 2, pp. 155-166, Mar. 2001.
4. D. Coppersmith, T. J. Nowicki, G. A. Paleologo, C. Tresser, and C.W.Wu, "The optimality of the on-line greedy algorithm in carpool and chairman assignment problems,"IBM Res. Rep. RC23 721, 2005.
5. J. F. Cordeau and G. Laporte, "The dial-a-ride problem: Models and algorithms,"Ann. Oper. Res., vol. 153, pp. 29-46, Sep. 2007.
6. J. F. Cordeau, "A branch-and-cut algorithm for the dial-a-ride problem,"Oper. Res., vol. 54, no. 3, pp. 573-586, May/Jun. 2006.
7. L. Coslovich, R. Pesenti, and W. Ukovich, "A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem,"Eur. J. Oper. Res., vol. 175, no. 3, pp. 1605-1615, Dec. 2006.
8. M. Diana and M. M. Dessouky, "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows,"Transp. Res. B, vol. 38, no. 6, pp. 539-557, Jul. 2004.
9. Y. Eun, I. Hwang, and H. Bang, "Optimal arrival flight sequencing and scheduling using discrete airborne delays,"IEEE Trans. Intell. Transp. Syst., vol. 11, no. 2, pp. 359-373, Jun. 2010.
10. R. Fagin and J.H. Williams, "A fair carpool scheduling algorithm,"IBM J. Res. Develop., vol. 27, no. 2, pp. 133-139, Mar. 1983.
11. E. Ferrari, R. Manzini, A. Pareschi, A. Persona, and A. Regattieri, "The car pooling problem: Heuristic algorithms based on savings functions,"J. Adv. Transp., vol. 37, no. 3, pp. 243-272, 2003.
12. M. L. Fisher, "The Lagrangian relaxation method for solving integer programming problem,"Manage. Sci., vol. 27, no. 1, pp. 1-18, Jan. 1981.
13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
14. Y. J. Guo, "Trip cost urban transportation,"M.S. thesis, Dept. Civil Eng., Nat. Taiwan Univ., Taipei, Taiwan, 2003.
15. R. M. JØrgensen, J. Larsen, and K. B. Bergvinsdottir, "Solving the dial-aride problem using genetic algorithms,"J. Oper. Res. Soc., vol. 58, no. 10, pp. 1321-1331, Oct. 2007.
16. V. Maniezzo, A. Carbonaro, and H. Hildmann, "An ANTS heuristic for the long-term car pooling problem,"in New Optimization Techniques in Engineering, G. C. Onwuboulu and B. V. Babu, Eds. Heidelberg, Germany: Springer-Verlag, 2004, pp. 411-430.
17. E. Melachrinoudis, A. B. Ilhan, and H. Min, "A dial-a-ride problem for client transportation in a healthcare organization,"Comput. Oper. Res., vol. 34, no. 3, pp. 742-759, Mar. 2007.
18. M. Naor, "On fairness in the carpool problem,"J. Algorithms, vol. 55, no. 1, pp. 93-98, Apr. 2005.
19. B. Rekiek, A. Delchambre, and H. A. Saleh, "Handicapped person transportation: An application of the grouping genetic algorithm,"Eng. Appl. Artif. Intell., vol. 19, no. 5, pp. 511-520, Aug. 2006.
20. S. Ropke, J. F. Cordeau, and G. Laporte, "Models and branch-andcut algorithms for pickup and delivery problems with time windows,"Networks, vol. 49, no. 4, pp. 258-272, Jul. 2007.
21. D. Teodorovic and G. Radivojevic, "A fuzzy logic approach to dynamic dial-a-ride problem,"Fuzzy Sets Syst., vol. 116, no. 1, pp. 23-33, Nov. 2000.
22. R. Wolfler-Calvo, F. L. Luigi, P. Haastrup, and V. Maniezzo, "A distributed geographic information system for the daily car pooling problem,"Comput. Oper. Res., vol. 31, no. 13, pp. 2263-2278, Nov. 2004.
23. K. I. Wong and M. G.H. Bell, "Solution of the dial-a-ride problem with multi-dimensional capacity constraints,"Int. Trans. Oper. Res., vol. 13, no. 3, pp. 195-208, May 2006.
24. Z. Xiang, C. Chu, and H. Chen, "A fast heuristic for solving a large-scale static dial-A-ride problem under complex constraints,"Eur. J. Oper. Res., vol. 174, no. 2, pp. 1117-1139, Oct. 2006.
25. S. Yan, "Approximating reduced costs under degeneracy in a network flow problem with side constraints,"Networks, vol. 27, no. 4, pp. 267-278, Jul. 1996.
26. S. Yan and C. G. Lin, "Airline scheduling for the temporary closure of airports,"Transp. Sci., vol. 31, no. 1, pp. 72-82, Feb. 1997.
27. S. Yan and H. F. Young, "A decision support framework for multi-fleet routing and multi-stop flight scheduling,"Transp. Res. A, vol. 30, no. 5, pp. 379-398, Sep. 1996.
28. S. Yan and Y. L. Shih, "Optimal emergency roadway repair and subsequent relief distribution,"Comput. Oper. Res., vol. 36, no. 6, pp. 2049- 2065, Jun. 2009.