A Graph-Induced Neighborhood Search Heuristic for the Capacitated Multicommodity Network Design Problem
In this work, an efficient graph-induced neighborhood search heuristic is proposed to address the capacitated multicommodity network design problem. This problem, which commonly arises in transportation and telecommunication, is well known for its inherent complexity and is often classified as <i...
Saved in:
| Main Author: | Houshan Zhang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/4/588 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Novel Traffic Scheduling Algorithm for Multi-CQF Using Mixed Integer Programming and Variable Neighborhood Search Genetic Algorithm in Time-Sensitive Networking
by: Cheng Wang, et al.
Published: (2025-07-01) -
Advanced Optimization Models for Bandwidth Provisioning and Routing in Fixed Microwave Backhaul Networks
by: Mehadji Djamil Abdelhak, et al.
Published: (2025-02-01) -
Stable Variable Fixation for Accelerated Unit Commitment via Graph Neural Network and Linear Programming Hybrid Learning
by: Linfeng Yang, et al.
Published: (2025-04-01) -
An Improved Large Neighborhood Search for Network-Level Airport Slot Allocation Optimization
by: Qiangzhe Wang, et al.
Published: (2025-01-01) -
Model for selective vehicle problem considering mixed fleet with capacitated electric vehicles
by: Jiacheng Li, et al.
Published: (2025-07-01)