The multiple traveling purchaser problem for maximizing system's reliability with budget constraints

Authors:
Myung Jin Choi;Sang Heon Lee
Affiliations:
Department of Operations Research, Korea National Defense University, Republic of Korea;Department of Operations Research, Korea National Defense University, Republic of Korea
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 7
Cited 0

Improved solutions for the traveling purchaser problem

Computers and Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Heuristics for the traveling purchaser problem

Computers and Operations Research
Improved heuristics for the traveling purchaser problem

Computers and Operations Research
Ant colony optimization for the traveling purchaser problem

Computers and Operations Research
The traveling purchaser problem with budget constraint

Computers and Operations Research
Approximate algorithms for the travelling purchaser problem

Operations Research Letters

Quantified Score

Hi-index	12.05

Visualization

Abstract

The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem (VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a TPP study considering the reliability of components. The purpose of this paper is to introduce the ILP formulation for multiple TPP to maximize system's reliability under budget constraint.