Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
- 3 Downloads
In this paper we analyze the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. Some of these problems have previously been introduced in the literature. All problems studied have a common objective: the maximization of the number of travelers using the new network to be built. The differences between them are due to two factors. The first one is the constraints that the new network should satisfy: (1) budget constraint, (2) no-cycle constraint, (3) both constraints. The second factor is the topology of the network formed by the feasible links and stations: (1) a general network, (2) a forest. By combining these two factors, in total we analyze six problems, five of them are shown to be NP-hard, the sixth being trivial. Due to the NP-hardness of these problems, a genetic algorithm is proposed. Computational experiments show the applicability of this algorithm.
KeywordsNetworks/graphs Transportation Computational complexity Genetic algorithms
Mathematics Subject Classification90B06
Mozart Menezes and Juan A. Mesa were partially supported by project MTM2015-67706-P (MINECO/FEDER,UE). Federico Perea was partially supported by the Spanish Ministry of Science, Innovation, and Universities, under projects “ OPTEP-Port Terminal Operations Optimization” (No. RTI2018-094940-B-I00) and MTM2016-74983, financed with FEDER funds, and by the Universitat Politècnica de València under grant SP20180164 of the program Primeros Proyectos de Investigaciòn (PAID-06-18), Vicerrectorado de Investigaciòn, Innovaciòn y Transferencia. All this support is gratefully acknowledged.
- Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. Annotated bibliography in combinatorial optimization. Wiley, New YorkGoogle Scholar
- Bussieck M, Winter T, Zimmermann U (1997) Discrete optimization in public rail transport. Math Prog 79(1–3):415–444Google Scholar
- Desaulniers G, Hickman MD (2007) Public transit. Transportation Handbooks in operations research and management science, vol 14. Elsevier, Amsterdam, pp 69–127Google Scholar
- Garey M, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. W.H Freeman and Company, USGoogle Scholar
- Guihaire V, Hao JK (2008) Transit network design and scheduling: a global review. Transp Res Part A 42:1251–1273Google Scholar
- Jegelka SS (2012) Combinatorial problems with sub-modular coupling in machine learning and computer vision. Thesis ETH ZurichGoogle Scholar
- Nemhauser GL, Wolsey LA (1999) Integer and combinatorial optimization. Wiley, AmsterdamGoogle Scholar