☆ 4.3 Article

Weighted iterated local branching for mathematical programming problems with binary variables

JOURNAL OF HEURISTICS (2022)

Related references

Note: Only part of the references are listed.

Article Operations Research & Management Science

Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows

Armando Teles Dauer et al.

Summary: This paper focuses on the multiple depot vehicle scheduling problem with heterogeneous fleet and time windows, presenting a time-space network modeling approach and two size reduction methods along with a mixed integer programming heuristic. Extensive testing and a real case study showed that the proposed methods achieved good performance and high-quality solutions within reasonable computational time.

OPTIMIZATION LETTERS (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

A reduced cost-based restriction and refinement matheuristic for stochastic network design problem

Fatemeh Sarayloo et al.

Summary: In this paper, we propose a solution approach for stochastic network design problems with uncertain demands. We aim to efficiently utilize reduced cost information to guide variable fixing, defining restrictions that reduce complexity without sacrificing solution quality. Our proposed matheuristic approach iteratively explores restricted regions of the global solution space, effectively obtaining high-quality solutions while reducing computational effort.

JOURNAL OF HEURISTICS (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

Weighted proximity search

Filipe Rodrigues et al.

Summary: Weighted proximity search is introduced as a new method for solving complex optimization problems, where different weights are assigned to variables based on their potential to improve the solution. This approach outperforms classic proximity search and commercial solvers in a majority of cases, demonstrating the effectiveness of weighted proximity search in improving solutions.

JOURNAL OF HEURISTICS (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

A local branching matheuristic for the multi-vehicle routing problem with stochastic demands

Florent Hernandez et al.

JOURNAL OF HEURISTICS (2019)

Add to Collection

Proceedings Paper Computer Science, Theory & Methods

Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem

Alexandre Frias Faria et al.

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2019)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Primal Heuristics for Branch and Price: The Assets of Diving Methods

Ruslan Sadykov et al.

INFORMS JOURNAL ON COMPUTING (2019)

Add to Collection

Article Mathematics, Applied

Generalized local branching heuristics and the capacitated ring tree problem

Alessandro Hill et al.

DISCRETE APPLIED MATHEMATICS (2018)

Add to Collection

Article Management

A local branching heuristic for the open pit mine production scheduling problem

Mehran Samavati et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow

Pedro Henrique Gonzalez et al.

COMPUTERS & OPERATIONS RESEARCH (2016)

Add to Collection

Article Computer Science, Artificial Intelligence

Proximity search for 0-1 mixed-integer convex programming

Matteo Fischetti et al.

JOURNAL OF HEURISTICS (2014)

Add to Collection

Article Computer Science, Information Systems

A survey on optimization metaheuristics

Ilhern Boussaid et al.

INFORMATION SCIENCES (2013)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A local branching heuristic for the capacitated fixed-charge network design problem

Inmaculada Rodriguez-Martin et al.

COMPUTERS & OPERATIONS RESEARCH (2010)

Add to Collection

Article Operations Research & Management Science

A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands

Walter Rei et al.

TRANSPORTATION SCIENCE (2010)

Add to Collection

Article Computer Science, Interdisciplinary Applications

An evolutionary algorithm for polishing mixed integer programming solutions

Edward Rothberg

INFORMS JOURNAL ON COMPUTING (2007)

Add to Collection

Article Computer Science, Software Engineering

Exploring relaxation induced neighborhoods to improve MIP solutions

E Danna et al.

MATHEMATICAL PROGRAMMING (2005)

Add to Collection

Article Mathematics, Applied

Adaptive memory search for Boolean optimization problems

LM Hvattum et al.

DISCRETE APPLIED MATHEMATICS (2004)

Add to Collection

Review Computer Science, Theory & Methods

Metaheuristics in combinatorial optimization: Overview and conceptual comparison

C Blum et al.

ACM COMPUTING SURVEYS (2003)

Add to Collection

Article Computer Science, Software Engineering

Local branching

M Fischetti et al.

MATHEMATICAL PROGRAMMING (2003)

Add to Collection

Article Computer Science, Artificial Intelligence

A heuristic for Boolean optimization problems

T Davoine et al.

JOURNAL OF HEURISTICS (2003)

Add to Collection

© Peeref 2019-2024. All rights reserved.