1;Preface;5 2;Contents;6 3;List of Contributors;8 4;Management Policies in a Dynamic Multi-Period Routing Problem;10 4.1;1 Introduction;10 4.2;2 The Dynamic Multi-Period Problem;12 4.3;3 Comparison of Alternative Management Policies;14 4.4;4 Computational Results;16 4.5;Conclusions;22 4.6;References;23 5;Optimizing the Storage Area Dimension in a Production System;25 5.1;1 Introduction;25 5.2;2 Problem Description and Formulation;26 5.3;3 Determining the Optimal Stock Dimension;29 5.4;4 Computational Results;31 5.5;Conclusions;35 5.6;Acknowledgements;35 5.7;References;35 6;On-line Routing per Mobile Phone: A Case on Subsequent Deliveries of Newspapers;37 6.1;1 Introduction;37 6.2;2 A Practical Case: Subsequent Deliveries of Newspapers;38 6.3;3 Mobile Business and Mobile Communication Solutions;40 6.4;4 AWeb/WAP Based Mobile Communication System;43 6.5;5 Decision Problems to be Addressed;48 6.6;6 Overview of Some Methods for On-Line Routing;52 6.7;7 Further Application Areas;55 6.8;8 Summary and Outlook;57 6.9;References;57 7;Service Design Models for Rail Intermodal Transportation;60 7.1;1 Introduction;60 7.2;2 Intermodal and Rail-Based Transportation;62 7.3;3 New Rail Intermodal Services;63 7.4;4 Impact on Planning Models;66 7.5;5 Conclusions;71 7.6;Acknowledgments;72 7.7;References;72 8;C.A.s.S.a.n.D.r.A.: Computerized AnalysiS for Supply ChAiN DistRibution Activity;75 8.1;1 Introduction;75 8.2;2 Analysis of SCM Activity;76 8.3;3 Dynamic System Models;80 8.4;4 Specification of the Statistical Properties;84 8.5;5 Computational Results;86 8.6;6 Conclusions;92 8.7;References;93 9;Ship Routing and Scheduling with Persistence and Distance Objectives;95 9.1;1 Introduction;95 9.2;2 Mathematical Formulation;98 9.3;3 Persistence Penalty Function;100 9.4;4 DistanceMeasure;101 9.5;5 Solution Method;101 9.6;6 Computational Study;102 9.7;7 Summary and Concluding Remarks;111 9.8;8 Acknowledgment;112 9.9;References;112 10;Logistics in Real-Time: Inventory-Routing Operations Under Stochastic Demand;114 10.1;1 Introduction;114 10.2;2 Problem Definition;117 10.3;3 Proposed Real-Time Strategies for the OIRP;119 10.4;4 Simulation Experiments and Results;130 10.5;5 Conclusion;137 10.6;Acknowledgments;139 10.7;References;139 10.8;Appendix;142 11;On Optimizing Production Nodes in Supply Chain Systems;154 11.1;1 Introduction;155 11.2;2 The Optimization Problem for a Single Node in a Supply Chain;157 11.3;3 Solution of Problem 2;161 11.4;4 Solution of Problem 3;167 11.5;5 The Multi-Site Case;175 11.6;6 Conclusions;178 11.7;References;178 12;Approximate Optimal Order Batch Sizes in a Parallel-aisle Warehouse;180 12.1;1 Introduction;180 12.2;2 Optimal Order Batch Sizes for Model-1;183 12.3;3 Optimal Order Batch Sizes for Model-2;190 12.4;4 Optimal Order Batch Sizes for the Total System;194 12.5;5 Concluding Remarks;197 12.6;References;198 13;Supply Chain Optimization for the Liquefied Natural Gas Business;200 13.1;1 Introduction;200 13.2;2 Description of a Real LNG Supply Chain Planning Problem;202 13.3;3 Arc-Flow Formulation;206 13.4;4 Path-Flow Formulation;213 13.5;5 Computational Results;217 13.6;6 Concluding Remarks;220 13.7;Acknowledgments;222 13.8;References;222 14;Modeling The Pre-Auction Stage: The Truckload Case;224 14.1;1 Introduction;224 14.2;2 The Outline of an Auction Process;226 14.3;3 Modeling the Shipper's Lane Selection Problem: The Truckload Case;229 14.4;4 Experimental Analysis;234 14.5;5 Conclusions and Future Research;236 14.6;References;236 15;Applications of the Double Standard Model for Ambulance Location;239 15.1;1 Introduction;239 15.2;2 Advanced Ambulance Location Models;241 15.3;3 Applications of the Double Standard Model;244 15.4;4 Conclusions;250 15.5;Acknowledgments;250 15.6;References;250 16;A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows;254 16.1;1 Introduction;254 16.2;2 Problem Formulation;255 16.3;3 The Algorithm;257 16.4;4 Experimental Results;265 16.5;5 Conclusions;267 16.6;Acknowledgmen