The mixed capacitated general routing problem with time‐dependent demands-Reference-Cited by-同舟云学术

The mixed capacitated general routing problem with time‐dependent demands

Published:2020-09-09 Issue:4 Volume:76 Page:467-484
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Ahabchane Chahid¹^ORCID,Langevin André¹,Trépanier Martin¹

Affiliation:

1. Department of Mathematical and Industrial Engineering CIRRELT and Polytechnique, Montréal, C.P. 6079, Succursale Centre‐ville Montreal Quebec Canada

Funder

Fonds de Recherche du Québec - Nature et Technologies

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21984

Reference49 articles.

1. An enhanced lower bound for the Time-Dependent Travelling Salesman Problem

2. Street‐segment‐based salt and abrasive prediction for winter maintenance using machine learning and GIS

3. A constraint programming approach to the Chinese postman problem with time windows

4. A lower bound for the Node, Edge, and Arc Routing Problem

5. A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A review of recent advances in time-dependent vehicle routing;European Journal of Operational Research;2024-11

2. The multidepot drone general routing problem with duration and capacity constraints;International Transactions in Operational Research;2024-03-23

3. A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs;2024

4. Arc Routing for Parking Enforcement Officers: Exact and heuristic solutions;European Journal of Operational Research;2022-05

5. Robust optimization for the hierarchical mixed capacitated general routing problem applied to winter road maintenance;Computers & Industrial Engineering;2021-08