Multiobjective optimization for multimode transportation problems
type: Item
instance of: scholarly article
title: Multiobjective optimization for multimode transportation problems
zbMATH Open document ID: 1397.90241
DOI: 10.1155/2018/8720643
author: Laurent Lemarchand
author: Damien Massé
author: Pascal Rebreyend
author: Johan Håkansson
published in: Advances in Operations Research
publication date: 2018-07-18T00:00:00Z
review text: Summary: We propose modelling for a facilities localization problem in the context of multimode transportation. The applicative goal is to locate service facilities such as schools or hospitals while optimizing the different transportation modes to these facilities. We formalize the School Problem and solve it first exactly using an adapted \(\varepsilon\)-constraint multiobjective method. Because of the size of the instances considered, we have also explored the use of heuristic methods based on evolutionary multiobjective frameworks, namely, NSGA2 and a modified version of PAES. Those methods are mixed with an original local search technique to provide better results. Numerical comparisons of solutions sets quality are made using the hypervolume metric. Based on the results for test-cases that can be solved exactly, efficient implementation for PAES and NSGA2 allows execution times comparison for large instances. Results show good performances for the heuristic approaches as compared to the exact algorithm for small test-cases. Approximate methods present a scalable behavior on largest problem instances. A master/slave parallelization scheme also helps to reduce execution times significantly for the modified PAES approach.
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6905053
zbMATH Keywords: multimode transportation
zbMATH Keywords: facilities localization problem
zbMATH Keywords: multiobjective method
describes a project that uses: CPLEX
describes a project that uses: OR-Library
describes a project that uses: MOEA/D
describes a project that uses: MOIP_AIRA
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8720643
OpenAlex ID: W2807331886
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: Solution methods for thep-median problem: An annotated bibliography
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Solving large \(p\)-median problems with a radius formulation
cites work: The discrete p-dispersion problem
cites work: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
cites work: Variable neighborhood search: Principles and applications
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Two phase algorithms for the bi-objective assignment problem
cites work: Evolutionary Algorithms for Solving Multi-Objective Problems
cites work: \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
cites work: An exact solution approach for multi-objective location-transportation problem for disaster response
cites work: Multi-criteria location planning for public facilities in tsunami-prone coastal areas
cites work: Applications of location analysis
cites work: Modelling and analysis of Canadian Forces strategic lift and pre-positioning options
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: Multi-objective integer programming: an improved recursive algorithm
cites work: An efficient genetic algorithm for the \(p\)-median problem
cites work: Q5192199
cites work: Q4704222
Wikidata QID: Q129711240
description: scientific article; zbMATH DE number 6905053