-

 

 

 




Optimization Online





 

The Selective Traveling Salesman Problem with Draught Limits

Shahin Gelareh(gelareh.shahin***at***gmail.com)
Bernard Gendron(gelareh.shahin***at***gmail.com)
Said Hanafi(Said.hanafi***at***univ-valenciennes.fr)
Rahimeh Neamatian Monemi(r.n.monemi***at***gmail.com)
Raca Todosijevic(gelareh.shahin***at***gmail.com)

Abstract: This paper introduces the Selective Traveling Salesman Problem with Draught Limits, an extension of Traveling Salesman Problem with Draught Limits, wherein the goal is to design maximal profit tour respecting draught limit constraints of the visited ports. We propose a mixed integer linear programming formulation for this problem. The proposed mixed integer program is used to solve –to optimality– small size instances and also to asses the quality of heuristic solutions found in the paper. The heuristic solutions are obtained using a general variable neighborhood search heuristic that explores several neighborhood structures. Our extensive computational experiments confirm the efficiency of the method and the quality of the reported solutions.

Keywords: VNS

Category 1: Applications -- OR and Management Sciences (Transportation )

Citation:

Download: [PDF]

Entry Submitted: 01/01/2017
Entry Accepted: 01/01/2017
Entry Last Modified: 01/01/2017

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society