JournalVolume 15, №3Modeling and Algorithms for Capacitated Transportation Networks with Population-Dependent
Travel Times (pages: 265-296)
Saber Shiripour, Iraj Mahdavi, Nezam Mahdavi-Amiri Abstract. At special times such as holidays or earthquake events, the traveling population in different routes to reach the servers such as tourist cities or disaster relief stations increases significantly. As the traveling population mounts, the travel times among different cities or stations and thus the total transportation time within the network increases. Thus, in an appropriate model, we need to take into account the actual travel times of routes to organize the distributed population on the existing transportation network. Here, we consider a capacitated location-multi allocation-routing problem with population-dependent travel times as a transportation network. The objective is to determine appropriate server locations among the candidate locations, allocation of the existing population at demand nodes to server locations and determination of movement paths of members to their corresponding servers with respect to simultaneous change of travel times so that the total transportation time is minimized. It is assumed that all links are two-way and capacity of the server nodes and arcs for accepting of population is limited. The problem is formulated as a mixed-integer nonlinear programming model, and then suitably transformed into a mixed-integer linear programming one. The computational results confirm that the CPLEX software package is effective to solve small problems. Here, for large problems, three different solution approaches are presented: a genetic metaheuristic, a hybrid heuristic obtained by combining a genetic algorithm and a local search and an evolutionary simulated annealing. Comparative numerical results show the effectiveness of the proposed algorithms.
Keywords: Population-Dependent Travel Times, Multi-Allocation, Mixed Integer Linear Programming, Genetic Algorithm, Local Search, Evolutionary Simulated Annealing.
AMS Subject Classification: 90B06, 90B10, 90B15, 90B18, 90B20, 90C05, 90C06, 90C11, 90C30, 90C59. |
|