物流管理英文文獻(xiàn)+翻譯

1、An internet-based logistics management system for enterprise chainsN. Prindezis, C.T. KiranoudisSchool of Chemical Engineering, National Technical University, 15780 Athens, GreeceReceived 13 September 2003; received in revised form 20 December 2003; accepted 27 January 2004Available online 10 Decemb

2、er 2004AbstractThis paper presents an Internet-Based Logistics Management System to coordinate and disseminate tasks and related information for solving the heterogeneous vehicle routing problem using appropriate metaheuristic techniques, for use in enterprise chain net works. Its architecture invol

3、ves a JAVA Web applet equipped with interactive communication capabilities between peripheral software tools. The system was developed in distributed software fashion technology for all computer platforms utilizing a Webbrowser, focusing on the detailed road network of Athens and the needs of the At

4、hens Central Food Market enterprises. 2004 Elsevier Ltd. All rights reserved.Keywords: Decision support system; e-Logistics; Transportation; Vehicle routing problem1. IntroductionEnterprise chains are the business model of the present and future regarding markets that involve small and medium compan

5、y sizes. Clearly, grouping activities towards a focused target facilitates an understandably improved market penetration guaranteed by a successful trade mark of a leading company in the field. Several collaboration models that basically include franchising are introduced as a part of this integrate

6、d process. When such a network is introduced in order to exploit a commercial idea or business initiative and subsequently expanded as market penetration grows, several management issues arise regarding the operations of the entire network. Such a network is the ideal place for organizing and evalua

7、ting in a more centralized way several ordinary operations regarding supply chain and logistics Infact, tools developed for organizing management processes and operational needs of each individual company, can be developed in a more centralized fashion and the services provided by the tool can be of

8、fered to each network member to facilitate transactions and tackle operations similarly. Web-based applications are an ideal starting place for developing such applications. Typically such systems serve as a central depot for distributing common services in the field of logistics. The commercial app

9、lication is stored in a central server and services are provided for each member of the group. A prototype of such a server is described in a previous work (Prindezis, Kiranoudis, & Marinos-Kouris,2003). This paper presents the completed inter net system that is installed in the central web server o

10、f the Athens Central Food Market that deals with the integrated problem of distribution for 690 companies that comprise a unique logistics and retail chain of enterprises. The needs of each company are underlined and the algorithms developed are described within the unified internet environment. The

11、 problem solved and services provided for each company is the one involving distribution of goods through a heterogeneous fleet of trucks. New insights of the metaheuristics employed are provided. A characteristic case study is presented to illustrate the effectiveness of the proposed approach for a

12、 real-world problem of distribution through the detailed road network of Athens.2. Distribution through heterogeneous vehicle fleetsThe fleet management problem presented in this paper requires the use of a heterogeneous fleet of vehicles that distribute goods through a network of clients(Tarantilis

13、, Kiranoudis, & Vassiliadis, 2003, 2004).Therefore, the system was designed in order to automatically generate vehicle routes (which vehicles should de-liver to which customers and in which order), using rational, quantitative, spatial and non-spatial information and minimizing simultaneously the ve

14、hicle cost and the total distance travelled by the vehicles, subject to the following constraints:l each vehicle has a predetermined load capacity, typically different from all other vehicles comprising the fleet (heterogeneous nature),l the capacity of a vehicle cannot be exceeded,l a single vehicl

15、e supplies each customers demand,l the number of vehicles used is predetermined.The problem has an obvious commercial value and has drawn the attention of OR community. Its great success can be attributed to the fact that it is a very interesting problem both from the practical and theoretical point

16、s of view. Regarding the practical point of view, the distribution problem involved definitely plays a central role in the efficiency of the operational planning level of distribution management, producing economical routes that contribute to the reduction of distribution costs, offering simultaneou

17、sly significant savings in all related expenses (capital, fuel costs, driver salaries). Its Importance in the practical level, motivated in tense theoretical work and the development of efficient algorithms.For the problem by academic researchers and professional societies in OR/MS, resulting in a n

18、umber of papers concerning the development of a number of Vehicle Routing Information Systems (VRIS) for solving the problem. The problem discussed is an NP-hard optimization problem, that is to say the global optimum of the problem can only be revealed through an algorithm of exponential time or sp

19、ace complexity with respect to problem size. Problems of this type are dealt with heuristic or metaheuristic techniques. Research on the development of heuristic algorithms (Tarantilis & Kiranoudis, 2001,2002a, 2002b) for the fleet management problem has made considerable progress since the first al

20、gorithms that were proposed in the early 60s. Among them, tabu search is the champion (Laporte, Gendreau, Potvin, & Semet,2000). The most powerful tabu search algorithmsare now capable of solving medium size and even largesize instances within extremely small computational environments regarding loa

21、d and time. On the algorithmic side, time has probably come to concentrate on the development of faster, simpler (with few parameters) and more robust algorithms, even if this causes a small loss in quality solution. These attributes are essential if an algorithm is to be implemented in a commercial

22、 package.The algorithm beyond the system developed is of tabu search nature. As mentioned before, since the algorithms cannot reveal the guaranteed global optimum, the time that an algorithm is left to propose a solution to the problem is of utmost importance to the problem. Certainly, there is a tr

23、ade-off between time expected for the induction of the solution and its quality. This part was implemented in a straightforward way. If the system is asked by the user to produce a solution of very high quality instantly, then an aggressive strategy is to be implemented. If the user relaxes the time

24、 of solution to be obtained, that is to say if the algorithm is left to search the solution space more effciently, then there is room for more elaborate algorithms.The algorithm employed has two distinct parts. The first one is a generalized route construction algorithm that creates routes of very g

25、ood quality to be improved by the subsequent tabu phase. The construction algorithm takes into account the peculiarities of the heterogeneous nature of fleet and the desire of the user to use vehicles of his own desire, owned or hired, according to his daily needs.The Generalized Route Construction

26、Algorithm employed, is a two-phase algorithm where unrouted customers are inserted into already constructed partial solutions. The set of partial solutions is initially empty, and in this case a seed route is inserted that contains only the depot. Rival nodes to be inserted are then examined.All rou

27、tes employed involve single unrouted customers. The insertion procedure utilizes two criteria c1(i,u,j) and c2(i,u,j) to insert a new customer u between two adjacent customers i and j of a current partial route. The first criterion finds the best feasible insertion point (i *,j *) that minimizes the

28、 Clark and Wright saving calculation for inserting a node within this specific insertion point,C1(i,u,j)=d(I,u)+d(u,j)-d(I,j) (1)In this formula, the expression d(k,l) stands for the actual cost involved in covering the distance between nodes k and l. The Clark and Wright saving calculation introduc

29、ed in this phase serves as an appropriate strong intensification technique for producing initial constructions of extremely good quality, a component of utmostnecessity in tabu improvement procedure.The second phase involves the identification of the actual best node to be inserted between the adjac

30、ent nodepair (i* ,j *) found in the first phase (Solomon, 1987). From all rival nodes, the one selected is the one that maximizes the expressionC2 (i*, u, j *)=d(0,u)+d(u,0)- C1(i*, u, j *) (2)where 0 denotes the depot node. The expression selected is the travelling distance directly from/to the dep

31、ot to/ from the customer and the additional distance expressedby the first criterion. In all, the first phase of the construction algorithm seeks for the best insertion point in all possible route seeds and when this is detected, the appropriate node is inserted. If no feasible node is found, a new

32、seed route, containing a single depot, is inserted. The algorithm iterates until there are no unrouted nodes. It must be stretched that the way routes are filled up with customers is guided by the desire of the user regardingthe utilization of his fleet vehicles. That is to say, vehicles are sorted

33、according to the distribution and utilization needs of the dispatcher. Vehicles to be used first (regarding to user cost aspects and vehicle availability) will be loaded before others that are of lower importance to the user. Typically, all users interviewed expressed the desire for the utilization

34、of greater tonnage vehicles instead of lower tonnage, so vehicles for loading were sorted in descending order of capacity.For the subsequent aggressive part of the algorithm a tabu search metaheuristic was implemented. The basic components of this algorithm employed in this application are the neigh

35、bourhood definition, the short-term memory and the aspiration criterion.2.1. NeighbourhoodThe neighbourhood is defined as a blend of the most favorable local search moves that transforms one solution to another. In particular, in its tabu search iteration the type of move adopted is decided stochast

36、ically. A predefined probability level is assigned to each move type. After that, it is decided whether the move operation is performed within a single route or between different routes, once more stochastically. This time, for both operations, the probability level is assigned a value of 50%. Subse

37、quently, the best neighbour that the selected move implies is computed. The move types employed are the 2-Opt move (Bell et al., 1983), the 11 Exchange move (Evans& Norback , 1985), the10 Exchangemove (Evans & Norback, 1985), on both single route and different routes.2.2. Short-term memoryShort-term

38、 memory, known as tabu list, is the most often used component of tabu search. Tabu list is imposed to restrict the search from revisiting solutions that were considered previously and to discourage the search process from cycling between subsets of solutions. For achieving this goal, attributes of m

39、oves, more precisely the reversals of the original ones, are stored in a tabu list. The reversal moves that contain attributes stored in tabu list are designated tabu and they are excluded from the search process. Regarding the tabu search variant implemented, these attributes are the nodes involved

40、 in the move (all the moves used in the this method can be characterized by indicating only two nodes) and the corresponding routes where these nodes belong to. The number ofiterations that arcsmobility is restricted is known as tabu list size or tabu tenure. The management of the tabu list is achie

41、ved by removing the move which has been on the tabu list longest.2.3. Aspiration criterionThe aspiration criterion is a strategy for overriding the short-term memory functions. The tabu search method implemented, uses the standard aspiration criterion: if a move gives a higher quality solution than

42、the best found so far, then the move is selected regardless its tabu status.Tabu Search algorithm terminates when the number of iterations conducted is larger than the maximum number of iterations allowed.3. Developing the internet-based application toolWeb services offer new opportunities in busine

43、ss landscape, facilitating a global marketplace where business rapidly create innovative products and serve customers better. Whatever that business needs is, Web services have the flexibility to meet the demand and allow to accelerate outsourcing. In turn, the developer can focus on building core c

44、ompetencies to create customer and shareholder value. Application development is also more efficient because existing Web services, regardless of where they were developed, can easily be reused.Many of the technology requirements for Web services exist today, such as open standards for business to-b

45、usiness applications, mission-critical transaction platforms and secure integration and messaging products. However, to enable robust and dynamic integration of applications, the industry standards and tools that extend the capabilities of to days business-to-business interoperability are required.

46、The key to taking full advantage of Web services is to understand what Web services are and how the market is likely to evolve. One needs to be able to invest in platforms and applications today that will enable the developer to quickly and effectively realize these benefits as well as to be able to

47、 meet the specific needs and increase business productivity.Typically, there are two basic technologies to be implemented when dealing with internet-based applications; namely server-based and client-based. Both technologieshave their strong points regarding development of the code and the facilitie

48、s they provide. Server-based applications involve the development of dynamically created web pages. These pages are transmitted to the web browser of the client and contain code in the form of HTML and JAVASCRIPT language. The HTML part is the static part of the page that contains forms and controls

49、 for user needs and the JAVASCRIPT part is the dynamic part of the page. Typically, the structure of the code can be completely changed through the intervention of web server mechanisms added on thetransmission part and implemented by server-based languages such as ASP, JSP, PHP, etc. This comes to

50、the development of an integrated dynamic page application where user desire regarding problem peculiarities (calculating shortest paths, execute routing algorithms, transact with the database, etc.) is implemented by appropriately invoking different parts of the dynamic content of such pages. In ser

51、ver-based applications allcalculations are executed on the server. In client-based applications, JAVA applets prevail. Communication of the user is guaranteed by the well-known JAVA mechanism that acts as the medium between the user and code.Everything is executed on the client side. Data in this ca

52、se have to be retrieved, once and this might be the time-consuming part of the transaction.In server-based applications, server resources are used for all calculations and this requires powerful server facilities with respect to hardware and software. Client-based applications are burdened with data

53、 transmission (chiefly related to road network data). There is a remedy to that; namely caching. Once loaded, they are left in the cache archives of the web browser to be instantly recalled when needed.In our case, a client-based application was developed. The main reason was the demand from the use

54、rs point of view for personal data discretion regarding their clients. In fact, this information was kept secret in our system even from the server side involved.Data management plays major role in the good function of our system. This role becomes more substantial when the distribution takes place

55、within a large and detailed road network like this of a major complex city. More specifically, in order to produce the proposed the routing plan, the system uses information about:l the locations of the depot and the customers within the road network of the city (their co-ordinates attached in the m

56、ap of the city),l the demand of the customers serviced,l the capacity of the vehicles used,l the spatial characteristics of road segments of the net work examined,l the topography of the road network,l the speed of the vehicle, considering the spatial characteristics of the road and the area within

57、of which is moved,l the synthesis of the company fleet of vehicles.Consequently, the system combines, in real time, the available spatial characteristics with all other information mentioned above, and tools for modelling, spatial, non-spatial, and statistical analysis, image processing forming a sc

58、alable, extensible and interoperable application environment.The validation and verification of addresses of customers ensure the accurate estimation of travel times and distances travelled. In the case of boundary in the total route duration, underestimates of travel time may lead to failure of the

59、 programmed routing plan whereas overestimates can lower the utilization of drivers andvehicles, and create unproductive wait times as well (Assad, 1991). The data corresponding to the area of interest involved two different details. A more detailed network, appropriately for geocoding (approximately 250,000 links) and a less detailed for routing (about 10,000 links). The two networks overlapped exactly. The tool that provides solut