G. Kindervater, J. Lenstra, and M. Savelsbergh. Parallel local search for the time-constrained traveling salesman. European Journal of Operational Research, 33:65-81, 1988. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bidding with Decommitment in a Multi-Agent Transportation .. - Hoen, van Bragt.. (2002) (1 citation) (Correct)
....insertion of the pickup and delivery point for the extra cargo [26] In addition, the segments of the route formed by the insertions are recalculated. 6 5Private communication (with E. Tempelman) 6Shortest routes can be calculated very fast by running parallel algorithms on multiple processors [9]. Also of interest are insertion heuristics as discussed in [8] which can be used to generate routes with an increased performance. Such approaches are beyond the scope of our efforts, but may be of interest for real life applications. 3. The Market Mechanism 4 3. THE MARKET MECHANISM 3.1 The ....
G. Kindervater, J. Lenstra, and M. Savelsbergh. Parallel local search for the time-constrained traveling salesman. European Journal of Operational Research, 33:65-81, 1988.
Bidding with Decommitment in a Multi-Agent Transportation .. - Hoen, van Bragt.. (2002) (1 citation) (Correct)
....of the pickup and delivery point for the extra cargo [ 26 ] In addition, the segments of the route formed by the insertions are recalculated. Private communication (with E. Tempelman) Shortest routes can be calculated very fast by running parallel algorithms on multiple processors [9]. Also of interest are insertion heuristics as discussed in [8] which can be used to generate routes with an increased performance. Such approaches are beyond the scope of our e orts, but may be of interest for real life applications. 3. The Market Mechanism 4 3. The Market Mechanism 3.1 The ....
G. Kindervater, J. Lenstra, and M. Savelsbergh. Parallel local search for the time-constrained traveling salesman. European Journal of Operational Research, 33:65-81, 1988.
Decommitment in Agent-Based Scheduling of Transport - Hoen, van Bragt, Poutré (Correct)
....brute force (with checking of capacity constraints) if not too long; once again 7 intermediate stops. Note that shortest routes can also be calculated using parallel algorithms with multi processor capacity (20 cheap cpu s) to compute a shortest route between 20 nodes in under 0. 005 seconds [ Kindervater et al. 1988 ] a sucient number of nodes in practice for our experiments. This is beyond the scope of our e orts, but of interest for a real life application. 2.4 The Auctions The depots for cargo double as distributed market places where not yet transported loads are auctioned to the highest bidding ....
G.A.P. Kindervater, J.K. Lenstra, and M.W.P. Savelsbergh. Parallel local search for the time-constrained traveling salesman. European Journal of Operational Research, 33:65-81, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC