Splitting a giant tour using integer linear programming: giant tour splitting

Bouzid, Mouaouia Cherif, Ait Haddadene, Hacene, Salhi, Said (2015) Splitting a giant tour using integer linear programming: giant tour splitting. Electronic Notes in Discrete Mathematics, 47 . pp. 245-252. ISSN 1571-0653. (doi:10.1016/j.endm.2014.11.032) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/j.endm.2014.11.032

Abstract

In this paper, we propose a polynomial way for optimally partitioning a giant tour using integer linear programming. The obtained model is extended to the mTSP with limited visits per tour. A hybridization of the variable neighbourhood search (VNS) heuristic with these mathematical models is also presented. Computational experiments are conducted using a conventional solver to illustrate the performance of some of these split-based models as well as their hybridization with VNS.

Item Type: Article
DOI/Identification number: 10.1016/j.endm.2014.11.032
Uncontrolled keywords: Routing problems, route first-cluster second, integer programming, variable neighbourhood search, hybridization.
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 23 Feb 2015 10:40 UTC
Last Modified: 29 May 2019 14:14 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/47304 (The current URI for this page, for reference purposes)
  • Depositors only (login required):