Browsing by Author "Woch, Marcin"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Article, Access status: Open Access , Manufacturing cost management in Microsoft Dynamics NAV 5.0 - a case study(AGH University of Science and Technology Press, 2008) Woch, Marcin; Łebkowski, PiotrThis article presents manufacturing costs management functionality in the ERP system Microsoft Dynamics NAV 5.0. The application supports consumption, complete tracking of component and finished product costs and manufacturing capacities, posting analysis and entering into the general ledger. During the implementation, numerous new functionalities and algorithms have been developed to streamline cost management, including standard and average costs update routines, as well as forecasting cost of future use of production resources.Item type:Article, Access status: Open Access , Sequential simulated annealing for the vehicle routing problem with time windows(Wydawnictwa AGH, 2009) Woch, Marcin; Łebkowski, PiotrThis article presents a new simulated annealing algorithm that provides very high quality solutions to the vehicle routing problem. The aim of described algorithm is to solve the vehicle routing problem with time windows. The tests were carried out with use of some well known instances of the problem defined by M. Solomon. The empirical evidence indicates that simulated annealing can be successfully applied to bi-criterion optimization problems.Item type:Doctoral Dissertation, Access status: Open Access , Sterowanie dyskretnymi procesami dystrybucji w logistyce(Data obrony: 2012) Woch, Marcin
Wydział Inżynierii Mechanicznej i RobotykiThe aim of the dissertation is to design an algorithm to calculate least cost routes from one central depot to a set of geographically scattered points, so called clients. Each point on the routes has to be visited only once by exactly one vehicle. All routes start and end at the central depot and the total demand of all the clients on one route must not exceed vehicle capacity. The Vehicle Routing Problem with Time Windows (VRPTW) is a generalization of the VRP involving the additional constraint that every customer must be served within a given time window. Time window requirement does not prevent any vehicle from arriving before the allowed start of service at a customer location. The fleet of vehicles is homogenous. The primary objective is minimization of the number of routes, total travelled distance and total duration of routes are considered as secondary aim. Thus the VRPTW is a bi-criterion optimization problem. The practical application of the VRPTW includes school bus routing, deliveries of goods to department stores, newspaper, mail distribution, maintenance services, etc. This dissertation presents a simulated annealing algorithm to solve the VRPTW. The objective is to find the best possible solutions to some Solomon and Cordeau (Multi Depot Vehicle Routing Problem with Time Windows) instances.
