Application of metaheuristics to large-scale transportation problems

DOI10.1007/978-3-662-43880-0_23MaRDI QIDQ5116364zbMATH OpenOpenAlexFDO

Authors Luca D'Acierno, Mariano Gallo, Bruno Montella

Publication date 25 August 2020

Published in Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43880-0_23

zbMATH Keywords

transportationnetwork designmetaheuristic algorithmsreal-scale networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Hybrid meta-heuristic algorithms for solving network design problem
• A meta-heuristic approach for solving the urban network design problem
• APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM
• scientific article; zbMATH DE number 1452993
• A metaheuristic for stochastic service network design

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
• A meta-heuristic approach for solving the urban network design problem
• Generalized network design problems.
• Scatter Search and Path Relinking: Advances and Applications
• Transportation systems analysis. Models and applications.

Cited in

(4)

• Hybrid meta-heuristic algorithms for solving network design problem
• A surrogate-based multiobjective metaheuristic and network degradation simulation model for robust toll pricing
• APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM
• Bio-inspired meta-heuristics for emergency transportation problems

This page was built for publication: Application of metaheuristics to large-scale transportation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116364)