Layer: An Alternative Approach To Solve Large Capacitated Vehicle Routing Problem with Time Window Using AI and Exact Method

Krishnendu Mukherjee

MPRA Paper from University Library of Munich, Germany

Abstract: To the best of my knowledge, this problem has never been addressed by any researcher. This paper studies the effect of K-means, the Gaussian Mixture Model (GMM), and the integrated use of autoencoder and K-means on the computational time, MIP gap, feasible route, subtour, and the optimum use of vehicles. Miller-Tucker-Zemlin (MTZ) subtour elimination constraint is considered in this regard. This paper also gives the concept of a “layer”, which could be effective to solve a large vehicle routing problem with a time window (VRPTW) quickly.

Keywords: Machine Learning; Deep Learning; Mixed Integer Linear Program; and Large VRPTW (search for similar items in EconPapers)
JEL-codes: C6 C61 C63 (search for similar items in EconPapers)
Date: 2023-06-03, Revised 2023-06-12
New Economics Papers: this item is included in nep-big and nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/117513/1/An%20Inte ... 0VRPTW%20Problem.pdf original version (application/pdf)

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:pra:mprapa:117513

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().