Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Army logistical systems and databases contain massive amounts of data that require effective methods of extracting actionable information and generating knowledge. Vehicle diagnostics and prognostics can be challenging to analyze from the Command and Control (C2) perspective, making management of the fleet difficult within existing systems. Databases do not contain root causes or the case-based analyses...
City logistics is facing the challenging problem of providing a quick-response and on-time delivery service in congested urban areas with frequent traffic jams. The dynamically changing traffic conditions make the predetermined best transportation plans suboptimal and consequently cause increased logistics cost and even greater air pollution. To help the driver determine time-optimal routing solutions...
Vehicular networks can generate a large amount of vehicular data which are useful to both car consumers and manufacturers. In this paper we propose to collect vehicular data and to mine vehicular data by using data mining models. The experiment results shows the proposed methods are effective.
The vehicle routing problem is an important problem in logistics. And it has taken as the NP hard problem. Most of the researchers want to get the best resources by many kinds of ways. But the real-world problem is much more difficult than the VRP. In order to make the model and get the solving strategy for the real-world VRP, the paper analysis the customers' demands and divides the problem into...
The vast majority of CRM implementation is failure to achieve desired results due to lack of successful CRM measurement indicators for it. Hence, a CRM measurement indicator system and a brief corresponding follow-up data-mining model were proposed and presented to guide the development and implementation of CRM tactics in logistics enterprises, especially for large-scale ones. Some principles of...
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional ant colony algorithm (ACA). The experiment results showed that the IACA can solve...
Logistics service suppliers are expected to make a reasonable collection routes to reduce service cost and improve service level. In this paper, the vehicle scheduling and routing model is proposed to choose optimal collection routes and to minimize the total cost which is composed by transport cost, overtime cost, punitive fine and inventory cost. A modified saving algorithm which takes the total...
The fleet size and mix vehicle routing problem (FSMVRP) consists of defining the type, the number of vehicles of each type, as well as the order in which to serve the customers with each vehicle when a company has to distribute goods to a set of customers geographically spread, with the objective of minimizing the total costs. In this paper, we study a real-life FSMVRP with time windows (FSMVRPTW)...
Due to the increased demands for distribution/redistribution, recycling and repacking, there has been a significant change in the logistics process. This article presented an ant colony system (ACS) algorithm to solve a vehicle routing problem with simultaneous delivery and pick-up (VRPSDP). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery...
Smooth logistics system contributes a lot to the success of chain operators, which is exerting ever increasing influence on China's economic development. This paper first analyzed the predominance of chain operators and then proceeded to the discussion of network implementation into logistics. Based on the reference of logistics advanced theory and the study of logistics chain management system, mathematical...
We study a split vehicle routing problem (VRP) with simultaneous pickup and delivery. Our problem is motivated by the logistics operations practice of a third-party logistics provider (3PL) who serves the inbound logistics for an automobile manufacturing company. We develop several greedy algorithms and a competitive decision algorithm to solve the problem, and conduct computational experiments to...
This paper considers the problem of planning the logistics of distributing medication to points of dispensing (PODs), which will give medication to the public. Previous work on a two-stage routing and scheduling approach showed that it can generate solutions with reasonable minimum slack. This paper presents a delivery volume improvement algorithm that can increase the minimum slack of a given solution.
VMI (vendor managed inventory) policy coordinates effectively the antinomy between the inventory and the transportation within logistics distribution system. Under VMI mode, integrating inventory and transportation of the supplier and the demander as a whole is considered to achieve the optimization of total distribution cost. In view of typical one-warehouse multiretailer distribution network in...
With the intensification of market competition and fast development of science and technology, many enterprises have begun to realize the importance of logistic distribution vehicle routing problem under uncertainty environment, and begin to pay more attention to the research of this problem. In this paper, The traditional vehicle routing problem with time windows is expanded to the situation that...
Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models in grain logistics (GLVRP) and its intelligent algorithm. The objective of GLVRP is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. In this paper, a novel real number encoding...
Combined with intelligent algorithms and dynamic multi-agent technology, this paper proposes an agile logistics distribution optimization model for scheduling vehicle routing problem (VRP) timely. This model uses frame structures to describe symbolic knowledge for model's target function and constraints, so that some issues involved in the logistics scheduling optimization can be done away with. The...
The paper describes the distribution vehicle routing optimization scheduling problem, and presents a mathematical model. Ant colony system which is a novel simulated evolutionary algorithm, it can good for NP-Hard problem. According to the features of the Vehicle routing problem with time windows and the ant colony algorithm, an improved ant colony system is proposed to solve this problem. An improved...
Over the last years Just-In-Sequence (JIS), i.e. a supplement to Just-In-Time by providing supplied parts in the right sequence, has become increasingly important. Even though a stable sequence is crucial to the implementation of a JIS process it can happen that a scheduled workpiece needs to be removed from the sequence, e.g. because of missing parts. Since a so-altered sequence might have a worse...
Logistics has received considerable attention recently due to the rapid technological development of electronics and the Internet. Normally, clients expect items to be delivered at times that are convenient for their own schedules. Therefore, a multi-objective problem (MOP) model that simultaneously considers the depot desires and clients expectations can better elucidate the real logistics operations...
Normal containers do not return with vessel usually, when they are discharged. But because of high rental of special containers, more cycle operations are accomplished which include discharging laden containers, trucks transports to clients and unloading cargoes, empty containers return and being loaded on the previous vessel, higher turnover rate will be, furthermore, less rental. It is an optimization...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.