A Bi-Level Bi-Objective Mathematical Model for Stop Location in a School Bus Routing Problem

被引:8
作者
Parvasi, Seyed Parsa [1 ]
Tavakkoli-Moghaddam, Reza [1 ]
Taleizadeh, Ata Allah [1 ]
Soveizy, Mohammad [2 ]
机构
[1] Univ Tehran, Sch Ind Engn, Coll Engn, Tehran, Iran
[2] KN Toosi Univ Technol, Dept Ind Engn, Tehran, Iran
关键词
location; routing; allocation; bi-level; bi-objective; Meta-heuristics; GENETIC ALGORITHM; FORMULATION; DESIGN; ROUTES;
D O I
10.1016/j.ifacol.2019.11.346
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, due to expansion of urban areas and population growth, the number of travels in the cities has increased dramatically and private vehicles are raised as a competitor to public transportation. Hence, designing a proper transportation system to encourage individuals to use public transportation is important. In this paper, a bi-level model for a bus stop location and bus routing problem based on leader-follower games is developed. The proposed strategy in this model is based on a location-allocation-routing (LAR) strategy. The first level (i.e., leader) concerns the location and routing problem and the second level (i.e., follower) concerns the allocation problem, in which the first level is a bi-objective optimization problem. In order to solve the model, two approaches are used that are based on the explicit enumeration and hybrid methods, respectively. Finally, the proposed approaches are used to solve a number of random instance problems, whose results indicate the effectiveness of the proposed algorithms. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码:1120 / 1125
页数:6
相关论文
共 18 条
[1]  
Bodin L. D., 1979, Transportation Science, V13, P113, DOI 10.1287/trsc.13.2.113
[2]   A MULTIOBJECTIVE OPTIMIZATION APPROACH TO URBAN SCHOOL BUS ROUTING - FORMULATION AND SOLUTION METHOD [J].
BOWERMAN, R ;
HALL, B ;
CALAMAI, P .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1995, 29 (02) :107-123
[3]   Bilevel model for production-distribution planning solved by using ant colony optimization [J].
Calvete, Herminia I. ;
Gale, Carmen ;
Oliveros, Maria-Jose .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :320-327
[4]   CLUSTERING FOR ROUTING IN DENSELY POPULATED AREAS [J].
CHAPLEAU, L ;
FERLAND, JA ;
ROUSSEAU, JM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 20 (01) :48-57
[5]   SCHOOL BUS ROUTES GENERATOR IN URBAN SURROUNDINGS [J].
DULAC, G ;
FERLAND, JA ;
FORGUES, PA .
COMPUTERS & OPERATIONS RESEARCH, 1980, 7 (03) :199-213
[6]   THE POLYNOMIAL HIERARCHY AND A SIMPLE-MODEL FOR COMPETITIVE ANALYSIS [J].
JEROSLOW, RG .
MATHEMATICAL PROGRAMMING, 1985, 32 (02) :146-164
[7]   Orthogonal genetic algorithm for solving quadratic bilevel programming problems [J].
Li, Hong ;
Jiao, Yongchang ;
Zhang, Li .
JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2010, 21 (05) :763-770
[8]  
Li L, 2002, J OPER RES SOC, V53, P552, DOI [10.1057/palgrave.jors.2601341, 10.1057/palgrave/jors/2601341]
[9]   A tri-level covering fortification model for facility protection against disturbance in r-interdiction median problem [J].
Mahmoodjanloo, Mehdi ;
Parvasi, Seyed Parsa ;
Ramezanian, Reza .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 102 :219-232
[10]   A Bilevel Genetic Algorithm for a real life location routing problem [J].
Marinakis, Yannis ;
Marinaki, Magdalene .
INTERNATIONAL JOURNAL OF LOGISTICS-RESEARCH AND APPLICATIONS, 2008, 11 (01) :49-65