The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

A Two-stage Stochastic Programming Approach for the Traveling Salesman ProblemTopics: Linear Programming; Mathematical Modeling; Optimization; Simulation; Stochastic Optimization

Related
Ontology
Subjects/Areas/Topics:Agents
;
Artificial Intelligence
;
Bioinformatics
;
Biomedical Engineering
;
Enterprise Information Systems
;
Information Systems Analysis and Specification
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Linear Programming
;
Mathematical Modeling
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Simulation
;
Stochastic Optimization
;
Symbolic Systems

Abstract: In the context of combinatorial optimization, recently some efforts have been made by extending classical optimization problems under the two-stage stochastic programming framework. In this paper, we introduce the two-stage stochastic traveling salesman problem (STSP). Let G = (V,ED ∪ES) be a non directed complete graph with set of nodes V and set of weighted edges ED ∪ES where ED ∩ES = 0/. The edges in ED and ES have deterministic and uncertain weights, respectively. Let K = {1,2,··· ,|K|} be a given set of scenarios referred to the uncertain weights of the edges in ES. The STSP consists in determining Hamiltonian cycles of G, one for each scenario s ∈ K, sharing the same deterministic edges while minimizing the sum of the deterministic weights plus the expected weight over all scenarios associated with the uncertain edges. We propose two compact models and a formulation with an exponential number of constraints which are adapted from the classic TSP. One of the compact models allows to solve instances with up to 40 nodes and 5 scenarios to optimality. Finally, we propose an iterative procedure that allows to compute optimal solutions and tight lower bounds within very small CPU time.(More)

In the context of combinatorial optimization, recently some efforts have been made by extending classical optimization problems under the two-stage stochastic programming framework. In this paper, we introduce the two-stage stochastic traveling salesman problem (STSP). Let G = (V,ED ∪ES) be a non directed complete graph with set of nodes V and set of weighted edges ED ∪ES where ED ∩ES = 0/. The edges in ED and ES have deterministic and uncertain weights, respectively. Let K = {1,2,··· ,|K|} be a given set of scenarios referred to the uncertain weights of the edges in ES. The STSP consists in determining Hamiltonian cycles of G, one for each scenario s ∈ K, sharing the same deterministic edges while minimizing the sum of the deterministic weights plus the expected weight over all scenarios associated with the uncertain edges. We propose two compact models and a formulation with an exponential number of constraints which are adapted from the classic TSP. One of the compact models allows to solve instances with up to 40 nodes and 5 scenarios to optimality. Finally, we propose an iterative procedure that allows to compute optimal solutions and tight lower bounds within very small CPU time.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Adasme, P.; Andrade, R.; Leung, J. and Lisser, A. (2016). A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem.In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, ISSN 2184-4372, pages 163-169. DOI: 10.5220/0005738801630169

@conference{icores16, author={Pablo Adasme. and Rafael Andrade. and Janny Leung. and Abdel Lisser.}, title={A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem}, booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,}, year={2016}, pages={163-169}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0005738801630169}, isbn={978-989-758-171-7}, }

TY - CONF

JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, TI - A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem SN - 978-989-758-171-7 AU - Adasme, P. AU - Andrade, R. AU - Leung, J. AU - Lisser, A. PY - 2016 SP - 163 EP - 169 DO - 10.5220/0005738801630169