6533b7d6fe1ef96bd12665e6

RESEARCH PRODUCT

The stacker crane problem and the directed general routing problem

Thais ÁVilaIsaac PlanaJosé M. SanchisÁNgel Corberán

subject

Mathematical optimizationDirected general routing problemStacker crane problemComputer Networks and CommunicationsStackerNode (networking)Branch-and-cut algorithmDirected graphResolution (logic)Directed rural postman problemHardware and ArchitectureRouting (electronic design automation)MATEMATICA APLICADASoftwareInformation SystemsMathematics

description

[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node routing problems as special cases, including the SCP. Large families of facet-defining inequalities for the DGRP are described and a branch-and-cut algorithm for these problems is presented. Extensive computational experiments over different sets of DGRP and SCP instances are included.

yearjournalcountryeditionlanguage
2015-01-01
10.13039/501100003359https://dx.doi.org/10.1002/net.21591