In this article, we study an Inventory Routing Problem with deterministic customer demand in a two-tier supply chain. The chain network consists of supplier using single vehicle given capacity to deliver product type multiple customers. We are interested population-based algorithms solve our problem. A Memetic Algorithm (MA) is developed based on the Genetic (GA) and Variable Neighborhood Searc...

centralizing and using proper transportation facilities cut down costs and traffic. hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. a distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

This paper considers an integrated routing and scheduling problem where the part takes into account costs tardiness penalties is modelled by a permutation flow shop with inventory costs. We assume that each batch served dedicated vehicle, number of batches their compositions (the jobs parameters those jobs) are known in advance. The to determine starting times on machine shop, departure dates d...

Inspired by the retail industry, we consider a stochastic inventory routing problem where retailers are replenished from central warehouse using time-based shipment consolidation policy. Such dispatching policy, facing demand repetitively at fixed times, is essential in practice. It allows for easy incorporation with dependent up- and downstream planning problems such as personal staffing opera...

We review recent literature pertaining to the maritime inventory routing problem (MIRP), a stimulating, albeit niche, subclass of vendor-managed problems. MIRPs deal with optimally distributing products (typically heterogeneous) vessel fleet between production and consumption ports tracking limits. present two mixed-integer linear programming models for MIRP—one based on discrete time, other co...