Cover Image

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fotedar, Sunney, Wu, Jiaming, Kulcsar, Balazs, Jornsten, Rebecka
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A user-driven pricing and scheduling framework for public electric vehicle charging
by: Zhou, Fangting, et al.
Published: (2026)

Collaborative electric vehicle routing with meet points
by: Zhou, Fangting, et al.
Published: (2023)

Collaborative Charging Scheduling via Balanced Bounding Box Methods
by: Zhou, Fangting, et al.
Published: (2025)

Coordinated vehicle dispatching and charging scheduling for an electric ride-hailing fleet under charging congestion and dynamic prices
by: Ma, Tai-Yu, et al.
Published: (2024)

Controlled descent training
by: Viktor Andersson, et al.
Published: (2024)

Benders decomposition for the large-scale probabilistic set covering problem
by: Liang, Jie, et al.
Published: (2025)

Minimum-Delay Opportunity Charging Scheduling for Electric Buses
by: McCabe, Dan, et al.
Published: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Chance-constrained battery management strategies for the electric bus scheduling problem
by: Ricard, Léa, et al.
Published: (2025)

A decomposition-based approach for large-scale pickup and delivery problems
by: Hiermann, G., et al.
Published: (2024)

Learning for routing: A guided review of recent developments and future directions
by: Zhou, Fangting, et al.
Published: (2025)

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
by: Huang, Pengfei, et al.
Published: (2025)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)

Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
by: Lv, Wei, et al.
Published: (2024)

Concave tents: a new tool for constructing concave reformulations of a large class of nonconvex optimization problems
by: Gabl, Markus
Published: (2024)

The pickup and delivery problem with time windows and scheduling on the edges
by: Barbosa, Vítor A., et al.
Published: (2025)

Finite dominating sets for the refueling station location problem in fleet operations
by: Nayeem, Moddassir Khan, et al.
Published: (2025)

Tractable reformulations of DRO problems over structured optimal transport ambiguity sets
by: Chaouach, Lotfi M., et al.
Published: (2025)

Grid-constrained online scheduling of flexible electric vehicle charging
by: van Huffelen, Emily, et al.
Published: (2024)

Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)

Optimal mixed fleet and charging infrastructure planning to electrify demand responsive feeder services with target CO2 emission constraints
by: Nakao, Haruko, et al.
Published: (2025)

A distributed augmented Lagrangian decomposition algorithm for constrained optimization
by: Guo, Wenyou, et al.
Published: (2025)

Averaging favors MPC: How typical evaluation setups overstate MPC performance for residential battery scheduling
by: Pinter, Janik, et al.
Published: (2025)

Robust charging station location and routing-scheduling for electric modular autonomous units
by: Xia, Dongyang, et al.
Published: (2025)

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
by: Sbihi, Mohammed, et al.
Published: (2024)

A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives
by: Consolini, Luca, et al.
Published: (2025)

Route planning of mobile sensing fleets for repeatable visits
by: Ji, Wen, et al.
Published: (2023)

Solution of a bilevel optimistic scheduling problem on parallel machines
by: Schau, Quentin, et al.
Published: (2026)

Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
by: Burns, Matthew X., et al.
Published: (2026)

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

Primal-dual proximal bundle and conditional gradient methods for convex problems
by: Liang, Jiaming
Published: (2024)

PyJobShop: Solving scheduling problems with constraint programming in Python
by: Lan, Leon, et al.
Published: (2025)

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
by: Li, Yu-Wei, et al.
Published: (2025)

Adaptive Benders decomposition and enhanced SDDP for multistage stochastic programs with block-separable multistage recourse
by: Mazzi, Nicolò, et al.
Published: (2025)

Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
by: Schau, Quentin, et al.
Published: (2026)

Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
by: Papageorgiou, Dimitri J., et al.
Published: (2025)

Internalizing sensing externality via matching and pricing for drive-by sensing taxi fleets
by: Yang, Binzhou, et al.
Published: (2024)

How long is long enough? Finite-horizon approximation of energy storage scheduling problems
by: Prat, Eléa, et al.
Published: (2024)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)