A greedy heuristic and a lower bound on a nonlinear stochastic TSP with partially satisfied node demand coverage constraint

Murat Cal and Senol Altan

International Journal of Mathematics in Operational Research, 2023, vol. 26, issue 3, 308-326

Abstract: The combinatorial travelling salesman problem (TSP) has driven researchers to find faster ways to solve the problem in reasonable times. As a result, researchers modified and created new TSP combinations such as multi-objective TSP or TSP with stochastic constraints. One of these constraints is the node demand coverage constraint. It makes sure that the demand of each node is satisfied in a route. In this study, we re-modify the node demand coverage constraint to be satisfied by some percentage of the time. This approach is more realistic because a node can be visited without covering its demand, allowing the missing of some nodes during the demand covering process while making our model nonlinear. We then provide a greedy heuristic in MATLAB and a lower bound determination procedure for this model and experiment with some predefined datasets.

Keywords: travelling salesman problem; TSP; chance constraints; nonlinear optimisation. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=134835 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:26:y:2023:i:3:p:308-326

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().