Combining supervised learning and local search for the multicommodity capacitated fixed-charge network design problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	La Rocca, Charly Robinson, Cordeau, Jean-François, Frejinger, Emma
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

One-shot Learning for MIPs with SOS1 Constraints
by: La Rocca, Charly Robinson, et al.
Published: (2024)

Supervised Large Neighbourhood Search for MIPs
by: La Rocca, Charly Robinson, et al.
Published: (2025)

On feasibility cuts for chance-constrained multicommodity network design problems
by: Wouda, Niels A., et al.
Published: (2024)

Progressive hedging for multi-stage stochastic lot sizing problems with setup carry-over under uncertain demand
by: Schlenkrich, Manuel, et al.
Published: (2025)

What makes a good public EV charging station? A revealed preference study
by: Lamontagne, Steven, et al.
Published: (2025)

Relative Explanations for Contextual Problems with Endogenous Uncertainty: An Application to Competitive Facility Location
by: Ramírez-Ayerbe, Jasone, et al.
Published: (2025)

Arc travel time and path choice model estimation subsumed
by: Mohammadpour, Sobhan, et al.
Published: (2022)

AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-scale Capacitated Vehicle Routing Problem
by: Máximo, Vinícius R., et al.
Published: (2022)

A Capacitated Collection-and-Delivery-Point Location Problem with Random Utility Maximizing Customers
by: Ulloa, David Pinzon, et al.
Published: (2024)

The Intermodal Railroad Blocking and Railcar Fleet-Management Planning Problem
by: Kienzle, Julie, et al.
Published: (2025)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

A Logistics Provider's Profit Maximization Facility Location Problem with Random Utility Maximizing Followers
by: Pinzon, David, et al.
Published: (2023)

Performance bounds for multi-vehicle networks with local integrators
by: Hansson, Jonas, et al.
Published: (2024)

Optimized electrified meeting-point-based feeder bus services with capacitated charging stations and partial recharges
by: Ma, Tai-Yu, et al.
Published: (2024)

A Survey of Contextual Optimization Methods for Decision Making under Uncertainty
by: Sadana, Utsav, et al.
Published: (2023)

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs
by: Li, Qingya, et al.
Published: (2024)

Accelerated windowing for the crew rostering problem with machine learning
by: Racette, Philippe, et al.
Published: (2025)

Local search and trajectory metaheuristics for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect
by: Araújo, Kennedy A. G., et al.
Published: (2024)

Compositional design for time-varying and nonlinear coordination
by: Hansson, Jonas, et al.
Published: (2025)

Closed-loop design for scalable performance of vehicular formations
by: Hansson, Jonas, et al.
Published: (2024)

New electric vehicle charging rate design : an MPEC assessment
by: Gomes, Icaro Silvestre Freitas, et al.
Published: (2026)

A line search framework with restarting for noisy optimization problems
by: Berahas, Albert S., et al.
Published: (2025)

The dual-path fixing strategy and its application to the set-covering problem
by: Yamagishi, Paulo Michel F., et al.
Published: (2026)

A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
by: Pacheco, Bruno Machado, et al.
Published: (2025)

Towards a connection between the capacitated vehicle routing problem and the constrained centroid-based clustering
by: Abdellaoui, Abdelhakim, et al.
Published: (2024)

Optimality of a refraction strategy in the optimal dividends problem with absolutely continuous controls subject to Parisian ruin
by: Locas, Félix, et al.
Published: (2023)

On the design of new classes of fixed-time stable systems with predefined upper bound for the settling time
by: Aldana-López, R., et al.
Published: (2019)

On a fixed-point continuation method for a convex optimization problem
by: Fest, Jean-Baptiste, et al.
Published: (2022)

Using deep learning to construct stochastic local search SAT solvers with performance bounds
by: Kramer, Maximilian J., et al.
Published: (2023)

Solution stability of parabolic optimal control problems with fixed state-distribution of the controls
by: Corella, Alberto Domínguez, et al.
Published: (2022)

Fairness by design in shared-energy allocation problems
by: Fornier, Zoé, et al.
Published: (2024)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
by: Li, Zekai, et al.
Published: (2024)

Quantitative regularity properties for the optimal design problem
by: Lamberti, Lorenzo, et al.
Published: (2025)

Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem
by: Lerouge, Mathieu, et al.
Published: (2026)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

The networked input-output economic problem
by: Trinh, Minh Hoang, et al.
Published: (2024)

A hybrid local search algorithm for the Continuous Energy-Constrained Scheduling Problem
by: Brouwer, Roel, et al.
Published: (2023)

Achieving consensus in networks of increasingly stubborn voters
by: Ohlin, David, et al.
Published: (2024)

Convergence towards a local minimum by direct search methods with a covering step
by: Audet, Charles, et al.
Published: (2024)