Journal ArticleDOI
An Exact ε-constraint Method for Bi-objective Combinatorial Optimization Problems - Application to the Traveling Salesman Problem with Profits
Reads0
Chats0
TLDR
It is shown in this paper that the Pareto front of bi-objective problems can be efficiently generated with the [epsilon]-constraint method and heuristics based on information gathered from previous subproblems that significantly speed up the method are described.About:
This article is published in European Journal of Operational Research.The article was published on 2009-04-01. It has received 334 citations till now. The article focuses on the topics: 2-opt & Bottleneck traveling salesman problem.read more
Citations
More filters
Journal ArticleDOI
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem
TL;DR: The MUCARP is heuristically tackled and an approximation of the optimal Pareto front is determined through an optimization-based heuristic procedure, whose performances are tested and analyzed on classical benchmark instances.
Journal ArticleDOI
A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms
TL;DR: In this paper , a mixed-integer linear programming (MILP) model was developed to formulate the sustainable periodic capacitated arc routing problem (PCARP) for municipal solid waste (MSW) management.
Journal ArticleDOI
Optimizing the choice of influential nodes for diffusion on a social network
TL;DR: A bi‐objective probabilistic integer programming model is developed that assumes that actors are heterogeneous in the probability that they will pass messages along their ego networks.
Journal ArticleDOI
A single vehicle routing problem with fixed delivery and optional collections
TL;DR: In this paper, a branch-and-cut method was proposed to solve the single-vehicle routing problem with fixed delivery and optional collections, where all delivery customers must be visited by the vehicle, while a collection customer is visited if the capacity of the vehicle is large enough to fit the collected load and the visit reduces collection costs that would be otherwise incurred.
Journal ArticleDOI
Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem
TL;DR: Investigation of the stochastic parallel machine ScheLoc problem to minimise the weighted sum of the location cost and the expectation of the total completion time shows that the scenario-based heuristic outperforms the SAA method and GA in terms of solution quality and computational time.
References
More filters
Book
Nonlinear Multiobjective Optimization
TL;DR: This paper is concerned with the development of methods for dealing with the role of symbols in the interpretation of semantics.
BookDOI
Multiple criteria decision analysis: state of the art surveys
TL;DR: In this article, the authors present a survey of the state of the art in multiple criterion decision analysis (MCDA) with an overview of the early history and current state of MCDA.
Journal ArticleDOI
Performance assessment of multiobjective optimizers: an analysis and review
TL;DR: This study provides a rigorous analysis of the limitations underlying this type of quality assessment in multiobjective evolutionary algorithms and develops a mathematical framework which allows one to classify and discuss existing techniques.
Journal ArticleDOI
TSPLIB—A Traveling Salesman Problem Library
TL;DR: This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.