loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Kamyar Khodamoradi and Ramesh Krishnamurti

Affiliation: Simon Fraser University, Canada

ISBN: 978-989-758-171-7

Keyword(s): Prize Collecting TSP, Linear Programming, Generalized Subtour Elimination Constraints, Primitive Comb Inequalities, Integrality Gap, Shrinking Heuristic.

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; e-Business ; Enterprise Information Systems ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Linear Programming ; Logistics ; Methodologies and Technologies ; Operational Research ; Optimization ; OR in Transportation ; Pattern Recognition ; Routing ; Software Engineering ; Symbolic Systems

Abstract: The Prize Collecting Travelling Salesman Problem (PCTSP) is an important generalization of the famous Travelling Salesman Problem. It also arises as a sub problem in many variants of the Vehicle Routing Problem. In this paper, we provide efficient methods to solve the linear programming relaxation of the PCTSP. We provide efficient heuristics to obtain the Generalized Subtour Elimination Constraints (GSECs) for the PCTSP, and compare its performance with an optimal separation procedure. Furthermore, we show that a heuristic to separate the primitive comb inequalities for the TSP can be applied to separate the primitive comb inequalities introduced for the PCTSP. We evaluate the effectiveness of these inequalities in reducing the integrality gap for the PCTSP.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.233.215.231

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Khodamoradi, K. and Krishnamurti, R. (2016). Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations.In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, pages 380-387. DOI: 10.5220/0005758103800387

@conference{icores16,
author={Kamyar Khodamoradi. and Ramesh Krishnamurti.},
title={Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2016},
pages={380-387},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005758103800387},
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 - Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations
SN - 978-989-758-171-7
AU - Khodamoradi, K.
AU - Krishnamurti, R.
PY - 2016
SP - 380
EP - 387
DO - 10.5220/0005758103800387

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.