Multi-directional local search
From MaRDI portal
Publication:339654
DOI10.1016/j.cor.2012.03.010zbMath1349.90751OpenAlexW2041384511WikidataQ42790744 ScholiaQ42790744MaRDI QIDQ339654
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.010
Related Items
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ Bi-objective orienteering for personal activity scheduling ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ A multi-objective approach for intermodal train load planning ⋮ Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Resource constrained routing and scheduling: review and research prospects ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ An iterated local search algorithm for a place scheduling problem ⋮ Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments ⋮ Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive evolutionary multiobjective optimization driven by robust ordinal regression
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
- Heuristics for the multi-period orienteering problem with multiple time windows
- A general heuristic for vehicle routing problems
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A fast and effective heuristic for the orienteering problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Solving multiple criteria choice problems by interactive trichotomy segmentation
- Record breaking optimization results using the ruin and recreate principle
- Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method
- On local optima in multiobjective combinatorial optimization problems
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Pareto simulated annealing for fuzzy multi-objective combinatorial optimization
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
