ISER © 2013 154http://iser.sisengr.

ISER © 2013 154
http://iser.sisengr.org
2. Previous Research
The VRP is one of the most studied among the combinatorial optimization problems, due both to its practical relevance and to its considerable difficulty. The VRP is concerned with the determination of the optimal routes used by a fleet of vehicles, based at one or more depots, to serve a set of customers. The objective considered could be the minimization of distance, time or cost. In a certain sense, the purpose would be to eliminate excess distance in excess, which is considered as waste in the lean thinking arena. Several surveys of the different algorithms developed to solve the VRP problem with various characteristics and assumptions are available in the literature (Golden & Assad, 1988; Laporte, et al., 2000; Laporte & Osman, 1995; Toth & Vigo, 2002). An important aspect in vehicle routing that affects operational performance is that of driver familiarity with service territories. This is more so when the number of clients is very large and vary significantly. Driver performance improves with his degree of familiarity with addresses and locations. This can be a valuable asset when confronted with an environment with stochastic demand because it provides the company with high levels of flexibility to redefine daily routes. A two step vehicle dispatching procedure that balances the trade-offs of route optimality and driver familiarity is provided in Zhong, et al., (2007). This research is the basis upon which was developed the UPS Roadnet transportation suite software. This tool will

ผลลัพธ์ (อังกฤษ) 3:

ISER © 2013 154 sb HTTP, which more iser.sisengr.org sb 2. Previous Research sb The VRP is one of the most studied among the combinatorial EOS Optimization problems, due both to its practical relevance and to its considerable difficulty in can The VRP is concerned with EOS The determination of the optimal routes used by a fleet of vehicles based at, one or more depots to serve, a set of customers.The objective considered could be the minimization of distance the time or cost. In a certain sense the the purpose would be EOS To eliminate excess distance in excess, which is considered as waste in the lean thinking arena in can Several surveys of the EOS Different algorithms developed to solve the VRP problem with various characteristics and assumptions are available in the. Literature (Golden, & Assad 1988;Laporte et, Al, 2000; Laporte, & Osman 1995; Toth, & Vigo 2002). An important aspect in vehicle routing that affects operational. Performance is that of driver familiarity with service territories. This is more so when the number of clients is very large. And vary significantly. Driver performance improves with his degree of familiarity with addresses and locations.This can be a valuable asset when confronted with an environment with stochastic demand because it provides the company. With high levels of flexibility to redefine daily routes. A two step vehicle dispatching procedure that balances the trade-offs. Of route optimality and driver familiarity is provided in Zhong, et al in can, (2007) in canThis research is the basis upon which was developed the UPS Roadnet transportation suite software. This tool will.