Modeling and Solving an Extended Version of Traveling Purchaser Problem

Please enable javascript in your browser.

Khademnia, Erfan | 2021

331 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 53892 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Eshghi, Kourosh
Abstract:
In this thesis, a special case of the Traveling Purchaser Problem (TPP) is considered in which instead of one vehicle there are multiple vehicles as purchasers. Furthermore, the vehicles start their path from a set of starting points and after visiting a number of markets they return to the depot. Moreover, each of the products needs a special loading condition and the vehicles have multiple compartments to meet these loading constraints and the products are loaded in their appropriate compartments. This problem is at first modeled as a MIP formulation and then by decomposing the problem a Column Generation procedure is developed to solve the problem. To enhance the speed of the column generation technique a heuristic initial solution and a stabilization technique are also added to the procedure. The initial heuristic is based on decomposing the problem into four major problems and then solve them in order. At last, we have tested these acceleration techniques on some sample problems to check their performances
Keywords:
Traveling Purchaser Problem ; Column Generation Algorithm ; Multi-Compartmental Model ; Heuristic Algorithm ; Open Route ; Multiple Compartments Vehicles

No TOC