Edward A. Wasil – författare

Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state of the art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.

Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the “. . . optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. ” Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:“Nopractical applications of the method have been made as yet. ” In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow computer-generated routes. The drivers visit 7. 9 million customers and handle an average of 15. 6 million packages [3].

Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the “. . . optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. ” Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:“Nopractical applications of the method have been made as yet. ” In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow computer-generated routes. The drivers visit 7. 9 million customers and handle an average of 15. 6 million packages [3].

Telecommunications Modeling, Policy, and Technology Examines the newer and emerging models of telecommunications technology that play instrumental roles in providing international economic and societal interconnectivity. Advancing technology in the field imposes the need to develop new models to solve complex planning and decision making problems. The global, national, and local societal impact of the technology necessitates careful analysis of telecommunications policy at all of these levels. The book explores natural output of the new technical developments and applications with selective chapter treatment on novel business models to fill the emerging technical and business needs.

Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the “. . . optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. ” Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:“Nopractical applications of the method have been made as yet. ” In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow computer-generated routes. The drivers visit 7. 9 million customers and handle an average of 15. 6 million packages [3].

Telecommunications Modeling, Policy, and Technology Examines the newer and emerging models of telecommunications technology that play instrumental roles in providing international economic and societal interconnectivity. Advancing technology in the field imposes the need to develop new models to solve complex planning and decision making problems. The global, national, and local societal impact of the technology necessitates careful analysis of telecommunications policy at all of these levels. The book explores natural output of the new technical developments and applications with selective chapter treatment on novel business models to fill the emerging technical and business needs.

Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state of the art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.

Management science is a di scipl ine dedicated to the development of techniques that enable decision makers to cope with the increasing complexity of our world. The early burst of excitement which was spawned by the development and successful applications of linear programming to problems in both the public and private sectors has challenged researchers to develop even more sophisticated methods to deal with the complex nature of decision making. Sophistication, however, does not always trans 1 ate into more complex mathematics. Professor Thomas L. Saaty was working for the U. S. Defense Department and for the U. S. Department of State in the late 1960s and early 1970s. In these positions, Professor Saaty was exposed to some of the most complex decisions facing the world: arms control, the Middle East problem, and the development of a transport system for a Third­ World country. While having made major contributions to numerous areas of mathematics and the theory of operations research, he soon realized that one did not need complex mathematics to come to grips with these decision problems, just the right mathematics! Thus, Professor Saaty set out to develop a mathematically-based technique for analyzing complex situations which was sophisticated in its simplicity. This technique became known as the Analytic Hierarchy Process (AHP) and has become very successful in helping decision makers to structure and analyze a wide range of problems.