1989
DOI: 10.1016/0305-0548(89)90051-8
|View full text |Cite
|
Sign up to set email alerts
|

The design of a computerized sanitation vehicle routing and scheduling system for the town of oyster bay, new york

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
21
0
6

Year Published

1995
1995
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(28 citation statements)
references
References 6 publications
1
21
0
6
Order By: Relevance
“…In fact, the authors say in [1] that "the idea of introducing direction-dependent demands is new", and in contrast, the literature is full of articles on real-world routing problems where the link demands do not depend on the direction of traversing the link, such as those solving waste collection or mail delivery problems (see e.g. [3,6,14]), which can be extended to the windy case.…”
Section: Find a Least-cost Set Of K Routes Each Starting And Ending mentioning
confidence: 99%
“…In fact, the authors say in [1] that "the idea of introducing direction-dependent demands is new", and in contrast, the literature is full of articles on real-world routing problems where the link demands do not depend on the direction of traversing the link, such as those solving waste collection or mail delivery problems (see e.g. [3,6,14]), which can be extended to the windy case.…”
Section: Find a Least-cost Set Of K Routes Each Starting And Ending mentioning
confidence: 99%
“…Note, however, 1), (1, 3), (3, 2), (5, 6), (8, 7), (7,2) . A shortest path from the first to the last layer is shown using bold edges.…”
Section: Reducing Computational Complexitymentioning
confidence: 99%
“…Consider, for example, the layered graph L 4 , corresponding to a hypothetical solution sequence S 4 = (2, 1), (1, 3), (3, 2), (5, 6), (8, 7), (7,2) , shown in Figure 3 The complexity reduction method is now described in general, using the alternative nota-tion for a move introduced earlier in the section. The method is described in some detail in the pseudo-code listing below, and may be read in conjunction with subsequent example, provided after the algorithm listing, to simplify understanding.…”
Section: Reducing Computational Complexitymentioning
confidence: 99%
See 1 more Smart Citation
“…See for example Bodin et al (1989) and Roy and Rousseau (1989). Later, turn penalties have been considered in the context of the Mixed Capacitated Arc Routing Problem (MCARP), see for example Bautista and Pereira (2004) and Belenguer et al (2006).…”
Section: Introductionmentioning
confidence: 99%