The DOI matches its Crossref record.
A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
Abstract
The shortest path problem with time windows (SPPTW) consists of finding the least cost route between a source and a sink in a network G = (N, A) while respecting specified time windows [ai, bi] at each visited node. The duration dij of each arc is restricted to positive values while the cost Cij of each arc (i, j) Є A is unrestricted.This article presents an efficient generalized permanent labelling algorithm to solve this problem. This new algorithm is based on the definition of the concept of a generalized bucket and on a specific order of handling the labels. The algorithm runs in pseudo-polynomial time. Problems with up to 2500 nodes and 250,000 arcs have heen solved.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Applications of operations research in the air transport industry
Barnhart, C., Belobaba, P., & Odoni, A. R. (2003) · Transportation Science · doi:10.1287/trsc.37.4.368.23276 · Cited by 309
A survey of resource constrained shortest path problems: Exact solution approaches
Pugliese, L. D. P., & Guerriero, F. (2013) · Networks · doi:10.1002/net.21511 · Cited by 147
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Metadata
- Authors
- Desrochers, M., & Soumis, F.
- Venue
- INFOR: Information Systems and Operational Research
- Publisher
- Informa UK Limited
- Published
- 1988-01
- Volume
- 26
- Issue
- 3
- Pages
- 191-212
- ISSN
- 0315-5986 (ISSN-L)
- 1916-0615
- OpenAlex
- W2408262133
- Cited by
- 349
- References
- 0
- FWCI
- 3.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows. https://app.cochat.ai/papers/10.1080/03155986.1988.11732063
- The paper
- Desrochers, M., & Soumis, F. (1988). A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows. INFOR: Information Systems and Operational Research. https://doi.org/10.1080/03155986.1988.11732063
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
