Pricing in Dynamic Vehicle Routing Problems
Published Online:1 Aug 2007https://doi.org/10.1287/trsc.1070.0193
References
- The prize collecting traveling salesman problem. Networks (1989) 19:621–636Crossref, Google Scholar
- Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. (2004) 52:977–987Link, Google Scholar
- A priori optimization. Oper. Res. (1990) 38:1019–1033Link, Google Scholar
- Waiting’ strategies for dynamic vehicle routing. Transportation Sci. (2005) 39:298–312Link, Google Scholar
- An optimization based bidding process: A new framework for shipper-carrier relationship. (1996) . Ph.D. thesis, School of Engineering, MIT, Cambridge, MAGoogle Scholar
- Transportation (2000) 5th ed.(South-Western College Publishing)Google Scholar
- Business models for Internet-based B2B electronic markets. Internat. J. Electronic Commerce (2002) 6:41–72Google Scholar
- The truck dispatching problem. Management Sci. (1959) 6:80–91Link, Google Scholar
- On prize-collecting tours and the asymmetric travelling salesman problem. Internat. Trans. Oper. Res. (1995) 2:297–309Crossref, Google Scholar
- Traveling salesman problems with profits. Transportation Sci. (2005) 39:188–205Link, Google Scholar
- Performance and analysis of spot truck-load procurement markets using sequential auctions. (2004) . Ph.D. thesis, School of Engineering, University of Maryland, College Park, MDGoogle Scholar
- Framework for study of carrier strategies in auction-based transportation marketplace. Transportation Res. Record (2003a) 1854:162–170Crossref, Google Scholar
- Modeling carrier behavior in sequential auction transportation markets. 10th Internat. Conf. Travel Behav. Res. (IATBR) (2003b) Lucerne, SwitzerlandGoogle Scholar
- Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions. Transportation Res. Record (2004) 1882:10–18Crossref, Google Scholar
- Auction settings and performance of electronic marketplaces for truckload transportation services. Transportation Res. Record (2005) 1906:89–97Crossref, Google Scholar
- Quantifying opportunity costs in sequential transportation auctions for truckload acquisition. Transportation Res. Record (2006) 1964:247–252Crossref, Google Scholar
- Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12Crossref, Google Scholar
- An adaptive dynamic programming algorithm for dynamic fleet management, I: Single period travel times. Transportation Sci. (2002) 36:21–39Link, Google Scholar
- The orienteering problem. Naval Res. Logist. (1987) 34:307–318Crossref, Google Scholar
- Dynamic routing problems with fruitful regions: Models and evolutionary computation. Parallel Problem Solving from Nature VIII (2004) (Springer, New York) Google Scholar
- Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. (2006) 40(4):421–438Link, Google Scholar
- Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. (2006) 40:211–225Link, Google Scholar
- A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. (1988) 36:929–936Link, Google Scholar
- , Golden B., Assad A. Probabilistic vehicle routing problems in vehicle routing: Methods and studies. Studies in Management Science and Systems (1988) 16(North Holland, Amsterdam, The Netherlands) 293–318Google Scholar
- Acceptance and dispatching policies for a distribution problem. Transportation Sci. (1998) 32:127–141Link, Google Scholar
- Auction Theory (2002) (Academic Press, San Diego, CA) Google Scholar
- The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13:133–142Crossref, Google Scholar
- The vehicle-routing problem with stochastic travel-times. Transportation Sci. (1992) 26:161–170Link, Google Scholar
- Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:635–655Crossref, Google Scholar
- Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:669–685Crossref, Google Scholar
- Freight transportation electronic marketplaces: A survey of market clearing mechanisms and exploration of important research issues. Proc. 84th Annual Meeting Transportation Res. Board (2005) Washington, D.C.(JanuaryGoogle Scholar
- A stochastic-model of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20:117–129Link, Google Scholar
- An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Res. Part B (1987) 21B(3):217–232Crossref, Google Scholar
- A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. (1996) 30:195–219Link, Google Scholar
- , Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Handbook in Operations Research and Management Science, Vol. 8, Network Routing (1995) (Elsevier, Amsterdam, The Netherlands) 141–296Google Scholar
- On the value of optimal myopic solution for dynamic routing and scheduling problems in the presence of user noncompliance. Transportation Sci. (2000) 34(1):50–66Link, Google Scholar
- Combinatorial auctions in the procurement of transportation services. Interfaces (2004) 34:245–252Link, Google Scholar
- Time window constrained routing and scheduling problems. Transportation Sci. (1988) 22:1–13Link, Google Scholar
- Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transportation Res. Part B (2005) 39:914Crossref, Google Scholar
- Stochastic vehicle-routing—A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385Crossref, Google Scholar
- TCA (2003) . Truckload Carrier Association Website. http://www.truckload.org/infocenter/TCAdocs/info_08_02_02.htmGoogle Scholar
- Anticipatory route selection. Transportation Sci. (2004) 38:473–487Link, Google Scholar
- The Theory of Industrial Organization (1989) (MIT Press, Cambridge, MA) Google Scholar
- Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. (2002) . Technical Report CL-00-02, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJGoogle Scholar
- An algorithm for approximating piecewise linear concave functions from sample gradients. Oper. Res. Lett. (2003) 31:66–76Crossref, Google Scholar
- Toth P., Vigo D.The Vehicle Routing Problem (2002) (Society for Industrial and Applied Mathematics, Philadelphia, PA) Crossref, Google Scholar
- Counterspeculation, auctions and competitive sealed tenders. J. Finance (1961) 16:8–37Crossref, Google Scholar
- Combinatorial bid generation problem for transportation service procurement. Network Modeling 2005 (2005) (Transportation Research Board Natl Research Council, Washington, D.C.) Google Scholar
- Real-time multivehicle truckload pickup and delivery problems. Transportation Sci. (2004) 38:135–148Link, Google Scholar
- Information transparency of business-to-business electronic markets: A game-theoretic analysis. Management Sci. (2004) 50:670–685Link, Google Scholar

