Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem

2026-04-14 · Source: Artificial Intelligence · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Robotics & Autonomous Systems · Depth: Expert, quick

Summary

A new bilevel Late Acceptance Hill Climbing algorithm (b-LAHC) has been developed to address the Electric Capacitated Vehicle Routing Problem (E-CVRP). This framework separates routing and charging decisions, or handles them jointly, based on the search stage, and employs a surrogate objective at the upper level to accelerate convergence. The b-LAHC algorithm operates through three phases: greedy descent, neighborhood exploration, and final solution refinement, using fixed parameters for simplicity and efficiency. Extensive experiments on the IEEE WCCI-2020 benchmark demonstrate that b-LAHC achieves superior or competitive performance against eight state-of-the-art algorithms. It attains near-optimal solutions on small-scale instances and establishes 9 out of 10 new best-known results on large-scale benchmarks, improving existing records by an average of 1.07% under a fixed evaluation budget.

Key takeaway

For logistics and operations researchers optimizing electric vehicle fleets, the b-LAHC algorithm offers a robust and efficient method for E-CVRP. Its ability to achieve near-optimal solutions on small instances and set new benchmarks on large-scale problems, improving records by 1.07%, suggests you should evaluate its integration into your routing optimization toolkit. This approach simplifies parameter management while enhancing solution quality for complex hierarchical routing challenges.

Key insights

Bilevel optimization with a surrogate objective effectively solves E-CVRP, achieving superior performance on large-scale instances.

Principles

• Separate routing and charging decisions for E-CVRP.
• Use a surrogate objective to guide search and accelerate convergence.

Method

The b-LAHC algorithm uses greedy descent, neighborhood exploration, and final solution refinement with fixed parameters to solve E-CVRP.

In practice

• Apply b-LAHC to large-scale E-CVRP instances.
• Consider bilevel optimization for complex routing problems.

Topics

• Electric Capacitated Vehicle Routing Problem
• Bilevel Late Acceptance Hill Climbing
• Bilevel Optimization
• Surrogate Objective
• Vehicle Routing Problems

Best for: AI Scientist, Research Scientist

Related on AIssential

• Instance-Aware Parameter Configuration in Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem — Instance-aware parameter configuration significantly improves metaheuristic performance for heterogeneous combinatorial optimization problems.
• Dynamic Deployment of Mobile Charging Trucks During Natural Disaster Evacuation: An Offline-to-Online Framework — Dynamic deployment of mobile charging trucks significantly reduces EV evacuee risk during disasters.
• Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles — A two-phase bilevel search and MICP formulation significantly improve solving the Moving-Target Traveling Salesman Problem with Moving Obstacles.
• Towards Efficient Constraint Handling in Neural Solvers for Routing Problems — CaR efficiently handles complex VRP constraints by jointly training construction and lightweight refinement modules with shared representations.
• Instance-Aware Parameter Configuration in Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem — Instance-aware parameter tuning significantly improves metaheuristic performance for heterogeneous optimization problems.
• Constrained user-item allocation for e-commerce marketing campaigns — Constrained spectral biclustering effectively auto-targets e-commerce campaigns by jointly optimizing user-item allocation for quality and fairness.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Artificial Intelligence.