Variable neighborhood search for the elementary shortest path problem with loading constraints

In this paper, we address the elementary shortest path problem with 2-dimensional loading constraints. The aim is to find the path with the smallest cost on a graph where the nodes represent clients whose items may have different heights and widths. Beyond its practical relevance, this problem appea...

Full description

Bibliographic Details
Main Author: Pinto, Telmo (author)
Other Authors: Alves, Cláudio (author), Valério de Carvalho, José Manuel (author)
Format: conferencePaper
Language:eng
Published: 2015
Subjects:
Computational study
Loading constraints
Shortest path problem
Variable neighborhood search
Science & Technology
Online Access:http://hdl.handle.net/1822/53144
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/53144

Internet

http://hdl.handle.net/1822/53144

Similar Items