39 citations · 59 across the 13 of their papers we have counts for
9 papers · 1 filter
The Agricultural Spraying Vehicle Routing Problem With Splittable Edge Demands
Qian Wan, Rodolfo García-Flores, Simon A. Bowly +2
In horticulture, spraying applications occur multiple times throughout any crop year. This paper presents a splittable agricultural chemical sprayed vehicle routing problem and for…
Ranking Constraint Relaxations for Mixed Integer Programs Using a Machine Learning Approach
Jake Weiner, Andreas T. Ernst, Xiaodong Li +1
Solving large-scale Mixed Integer Programs (MIP) can be difficult without advanced algorithms such as decomposition based techniques. Even if a decomposition technique might be app…
Adaptive Solution Prediction for Combinatorial Optimization
Yunzhuang Shen, Yuan Sun, Xiaodong Li +2
This paper aims to predict optimal solutions for combinatorial optimization problems (COPs) via machine learning (ML). To find high-quality solutions efficiently, existing work use…
Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring
Yunzhuang Shen, Yuan Sun, Xiaodong Li +2
Column Generation (CG) is an effective method for solving large-scale optimization problems. CG starts by solving a sub-problem with a subset of columns (i.e., variables) and gradu…
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem
Ahmad Kazemi, Pierre Le Bodic, Andreas Ernst +1
When solving hard multicommodity network flow problems using an LP-based approach, the number of commodities is a driving factor in the speed at which the LP can be solved, as it i…
Instance Space Analysis for the Car Sequencing Problem
Yuan Sun, Samuel Esler, Dhananjay Thiruvady +3
We investigate an important research question for solving the car sequencing problem, that is, which characteristics make an instance hard to solve? To do so, we carry out an insta…
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
Andreas Ernst, Lars Grüne, Janosch Rieger
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that in…
A hybrid Benders decomposition and bees algorithm matheuristic approach to transmission expansion planning considering energy storage
Cameron A. G. MacRae, Melih Ozlen, Andreas T. Ernst
This paper introduces a novel hybrid optimisation algorithm that combines elements of both metaheuristic search and integer programming. This new matheuristic combines elements of…
Transmission Expansion Planning Considering Energy Storage
Cameron A. G. MacRae, Melih Ozlen, Andreas T. Ernst
In electricity transmission networks, energy storage systems (ESS) provide a means of upgrade deferral by smoothing supply and matching demand. We develop a mixed integer programmi…