We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
EXACT SOLUTION APPROACHES FOR THE DIRECTED BI-OBJECTIVE CHINESE POSTMAN PROBLEM.
- Authors
Eroğlu, Ezgi; Azizoğlu, Meral
- Abstract
In this study, we consider a directed bi-objective Chinese Postman Problem with two additive objectives (like total cost and total distance) and propose two solution approaches to generate all non-dominated objective vectors. The first approach, namely classical approach, uses the optimal solutions of the mixed integer linear programs and generates the non-dominated objective vectors' set sequentially. The second approach, namely branch and bound algorithm takes its spirit from the optimal solutions of the linear programming relaxations and generates the non-dominated objective vectors' set simultaneously. The results of our extensive computational study show that our approaches are capable of solving large-sized problem instances in reasonable times.
- Subjects
ROUTE inspection problem; MIXED integer linear programming; GRAPH theory; COMBINATORIAL optimization; VECTORS (Calculus)
- Publication
Journal of Industrial Engineering (Turkish Chamber of Mechanical Engineers), 2018, Vol 29, Issue 1/2, p15
- ISSN
1300-3410
- Publication type
Article