Container routing in multimodal and time – dependent network using genetic algorithms
This article deals with the intermodal transportation problem for the commodities delivery between different locations. The time – dependent shortest path planning, in which the travel time along each arc is a known function of the departure time along the arc, is a very important problem and arises...
Main Authors: | Claudiu Domuţă, Mihai Hulea, Adina Astilean |
---|---|
Format: | Article |
Language: | English |
Published: |
Editura Universităţii "Petru Maior"
2011-12-01
|
Series: | Scientific Bulletin of the ''Petru Maior" University of Tîrgu Mureș |
Subjects: | |
Online Access: | http://scientificbulletin.upm.ro/papers/2011/12/Domuta-Claudiu-Hulea-Mihai-Astilean-Adina-Container-routing-in-multimodal-and-time-%E2%80%93-dependent-network-using-genetic-algorithms1.pdf |
Similar Items
-
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
by: Ben Strasser, et al.
Published: (2021-03-01) -
Time-Dependent Alternative Route Planning: Theory and Practice
by: Spyros Kontogiannis, et al.
Published: (2021-07-01) -
An FPTAS for Dynamic Multiobjective Shortest Path Problems
by: Pedro Maristany de las Casas, et al.
Published: (2021-01-01) -
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
by: Xianbiao Hu, PhD, et al.
Published: (2015-01-01) -
Travelling Choices Made Easier using Dijkstra Algorithm
by: Wardah Mohd Noor, et al.
Published: (2017-12-01)