Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints

European Journal of Operational Research

Volumn 185, Issue 2, 2008, Pages 481-494

  Quadrifoglio, Luca ^a   Dessouky, Maged M ^b   Ordóñez, Fernando ^b  

^a Texas AandM University   (United States)

^b University of Southern California ^*  (United States)

Author keywords

Constraints satisfaction; Integer programming; Transportation

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; PROGRAM PROCESSORS; STATIC ANALYSIS;

CONSTRAINTS SATISFACTION; FEASIBLE REGION; MIXED INTEGER PROGRAMMING (MIP); MOBILITY ALLOWANCE SHUTTLE TRANSIT (MAST);

MOTOR TRANSPORTATION;

EID: 34548825097     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.12.030     Document Type: Article

References (30)

1. Aldaihani M.M., and Dessouky M. Hybrid scheduling methods for paratransit operations. Computers & Industrial Engineering 45 (2003) 75-96
2. Aldaihani M.M., Quadrifoglio L., Dessouky M.M., and Hall R.W. Network design for a grid hybrid transit service. Transportation Research A 38 (2004) 511-530
3. Andalaft N., Andalaft P., Guignard M., Magendzo A., Wainer A., and Weintraub A. A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation. Operations Research 51 (2003) 613-628
4. Cordeau J.F., and Laporte G. The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR 1 2 (2003) 89-101
5. Cortés C.E., and Jayakrishnan R. Design and operational concepts of a high coverage point-to-point transit system. Transportation Research Record 1783 (2002) 178-187
6. Crainic T.G., Malucelli F., and Nonato M. Flexible many-to-few + few-to-many = an almost personalized transit system. TRISTAN IV, São Miguel Azores Islands (2001) 435-440
7. Daganzo C.F. Checkpoint dial-a-ride systems. Transportation Research B 18 (1984) 315-327
8. Desaulniers, G. et al., 2000. The VRP with pickup and delivery. Cahiers du GERARD G-2000-25, Ecole des Hautes Etudes Commerciales, Montréal.
9. Desrosiers J., Dumas Y., and Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Science 6 (1986) 301-325
10. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22
11. Fischetti M., and Toth P. An additive bounding procedure for combinatorial optimization problems. Operations Research 37 (1989) 319-328
12. Guignard, M., Ryu, C., Spielberg, K., 1994. Model tightening for integrated timber harvest and transportation planning. In: Proceedings of the International Symposium Systems Analysis Management Decisions Forestry, Valdivia, Chile, pp. 364-369.
13. Guignard M., Ryu C., and Spielberg K. Model tightening for integrated timber harvest and transportation planning. European Journal of Operational Research 111 (1998) 448-460
14. Hickman, M., Blume, K., 2000. A method for scheduling integrated transit service. In: 8th International Conference on Computer-Aided Scheduling of Public Transport (CASPT), Berlin, Germany.
15. Kalantari B., Hill A.V., and Arora S.R. An algorithm for the traveling salesman problem with pickup and delivery customers. European Journal of Operational Research 22 (1985) 377-386
16. Kirby M.W., Hager W., and Wong P. Simultaneous planning of wildland transportation alternatives. TIMS Studies in the Management Sciences 21 (1986) 371-387
17. Liaw C.F., White C.C., and Bander J.L. A decision support system for the bimodal dial-a-ride problem. IEEE Transactions on Systems, Man, and Cybernetics 26 5 (1996) 552-565
18. Lu Q., and Dessouky M.M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 38 (2004) 503-514
19. Malucelli, F., Nonato, M., Pallottino, S., 1999. Demand adaptive systems: Some proposals on flexible transit. In: Ciriania, T., Johnson, E., Tadei, R. (Eds.), Operations Research in Industry, pp. 157-182.
20. Psaraftis H. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14 (1980) 130-154
21. Psaraftis H. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17 (1983) 351-357
22. Quadrifoglio, L., Dessouky, M.M., 2007. Sensitivity analyses over the service area for mobility allowance shuttle transit (MAST) services. Lecture Notes in Economics and Mathematical Systems (in press).
23. Quadrifoglio L., Hall R.W., and Dessouky M.M. Performance and design of mobility allowance shuttle transit (MAST) services: Bounds on the maximum longitudinal velocity. Transportation Science 40 3 (2006) 351-363
24. Quadrifoglio L., Dessouky M.M., and Palmer K. An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services. Journal of Scheduling 10 (2007) 25-40
25. Ruland K.S., and Rodin E.Y. The pickup and delivery problem: Faces and branch-and-cut algorithm. Computers & Mathematics with Applications 33 12 (1997) 1-13
26. Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 (1995) 17-29
27. Schrijver A. Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization (1986), Wiley, New York
28. Wolsey L.A. Strong formulations for mixed integer programming: A survey. Mathematical Programming 45 (1989) 173-191
29. Wolsey L.A. Strong formulations for mixed integer programs: Valid inequalities and extended formulations. Mathematical Programming 97 (2003) 423-447
30. Zhao, J., Dessouky, M.M., 2007. Optimal service capacity for a single bus mobility allowance shuttle transit (MAST) system, submitted for publication.