Inventory Routing and Pricing Problem in a Supply Chain

Please enable javascript in your browser.

Abdollahi, Hassan | 2012

527 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 43945 (01)
University: sharif University of Technology
Department: Industrial Engineering
Advisor(s): Hajji, Alireza
Abstract:
Nowadays competition in business world has increased drastically. Under these competitive circumstances, it is the supply chains that compete against each other rather than individual firms. Accordingly trying to achieve integrated and synchronized management of activities within a supply chain has become inevitable. Recently researchers have found interest in a particular problem in a supply chain and that is to minimize inventory and routing costs in a supply chain. This problem is known as Inventory Routing Problem (IRP) and has been intensely examined in past few years. In this thesis we will try to expand this well-known problem in pricing dimension. We call this new problem “Inventory Routing and Pricing Problem”(IRPP). We will provide mathematical models under different assumptions for this problem. Like all other models for the IRP problem these models are from MINLP type. Since the IRP problem is a NP-hard problem, IRPP is also NP-hard and in order to solve it in a reasonable amount of time we will provide a hybrid methaheuristic algorithm consisting of Tabu Search and Particle Swarm Optimization algorithms
Keywords:
Supply Chain ; Tabu Search Algorithm ; Particles Swarm Optimization (PSO) ; Mixed Integer Nonlinear Programming (MINLP) ; Inventory-Routing Problem (IRP)

No TOC