0000000000278359

AUTHOR

Margaretha Gansterer

showing 4 related works from this author

The collaborative consistent vehicle routing problem with workload balance

2021

Abstract The rising competition in the logistics sector forces companies to be more economically efficient. One of the major sources of inefficiency is the incomplete usage of available resources, such as vehicles’ capacities. Mechanism that allow to better exploit such resources by enabling carrier collaborations are on the rise. Our study examines a centrally organized multi-period collaborative vehicle routing problem, where carriers can exchange customers who have to be serviced on a regular basis. Collaborations, where carriers serve frequent customers, are supposed to face the problem of (i) time consistency in terms of visiting time, and of (ii) service consistency. The latter ensure…

Service (business)050210 logistics & transportation021103 operations researchInformation Systems and ManagementGeneral Computer ScienceOperations researchconsistencyComputer scienceIterated local search05 social sciences0211 other engineering and technologiesWorkloadTime horizon02 engineering and technologycollaborationsManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringConsistency (database systems)Order (exchange)routingModeling and Simulation0502 economics and businessVehicle routing problemmatheuristicsperiodic vehicle routing
researchProduct

The on-demand warehousing problem

2022

Warehouses are key elements of supply chain networks, and great attention is paid to increase their efficiency. Highly volatile space requirements are enablers of innovative resource sharing concepts, where warehouse capacities are traded on online platforms. In this context, our paper introduces the on-demand warehousing problem from the perspective of platform providers. The objective prioritises demand–supply matching with maximisation of the number of transactions. If there is a tie, the secondary objective maximises the number of suppliers matched with at least one customer and the number of customers that have matches within a specific threshold with respect to the minimum achievable …

combinatorial optimisationSharing economy demand–supply matching warehouse combinatorial optimisation matheuristicmatheuristicStrategy and Managementdemand–supply matchingwarehouseSettore MAT/09 - Ricerca OperativaManagement Science and Operations ResearchSharing economyIndustrial and Manufacturing EngineeringInternational Journal of Production Research
researchProduct

Vehicle routing with private and shared delivery locations

2021

Abstract The rapid growth of e-commerce has led to an increase of home delivery requests. Providing efficient distribution systems for services on the last mile has become a challenging issue for logistics companies, where a trade-off between the classical approaches, attended home delivery (AHD) and usage of shared delivery locations (SDLs) has been identified. AHD provides a higher quality of service but implies very high costs for the company, while usage of SDL requires customers to perform the very last mile by themselves. For companies, this bears the risk of a decrease in the perceived service quality. However, due to consolidation effects, transportation costs can be considerably mi…

Service (business)0209 industrial biotechnologyService quality021103 operations researchGeneral Computer ScienceOperations researchComputer scienceQuality of servicemedia_common.quotation_subject0211 other engineering and technologies02 engineering and technologyManagement Science and Operations Research020901 industrial engineering & automationConsolidation (business)Last-mile delivery Sharing Routing Locker boxes MatheuristicsOrder (business)Modeling and SimulationVehicle routing problemQuality (business)Last milemedia_commonComputers & Operations Research
researchProduct

Vehicle scheduling for rental-with-driver services

2021

Abstract In this paper, we introduce a new vehicle scheduling problem (VSP) with driver consistency faced by rental-with-driver companies. A weekly time-horizon is considered and a set of potential customers, each one associated with a list of required tasks, is assumed. The company can choose to accept or reject a customer, but if accepted, all required tasks must be performed by the same driver. A profit is associated with each customer. The goal is to maximize the company’s total profit, by respecting a list of daily and the weekly drivers’ workload limitations imposed by drivers’ contracts. We propose a mathematical formulation of the problem and design an exact solution method based on…

Service (business)Profit (accounting)Job shop schedulingOperations researchComputer scienceTransportationWorkloadWorkload limitationsScheduling (computing)Task (project management)Consistency (database systems)Combinatorial Benders cutsVehicle schedulingConsistencyBusiness and International ManagementSet (psychology)Civil and Structural Engineering
researchProduct