Conveying product which has a limited shelf-life optimally is the concern of this study. The primary attribute of this product is perishable within a specific time frame. However, the perishable product has a critical issue in the cold chain system which leads dispatching costs inefficiency problems. Regarding this problem, a mathematical model built thru extended a vehicle routing problem, with soft time windows (VRPSTW) by considering energy consumption cost to evaluate its contribution towards the objective function. Model building conducted into computer programming that uses Python Spyder 3 for generating a feasible solution. For the sake of feasibility, a metaheuristic approach of genetic algorithms provided to find the best optimal solution; the results diagnosed that genetic algorithms can generate best feasible solution efficiently within a certain number of variables in case of perishable product delivery.

The focus of national development on the infrastructure sector impacts on the rapid growth of the construction market. High demand and complex business processes make ready-mix concrete producers especially in Jakarta no longer able to rely on route planning and manual scheduling mechanisms, which have been some delays in deliveries that impact on the decline in service level. This research proposes an optimization method based on mixed integer linear programming on route planning mechanism and scheduling of ready-mix concrete delivery developed in Java language with Gurobi optimization library support. The simulation is done using the companys historical data of the research object, which is one of the ready-mix concrete producers in Jakarta. From the four simulations, the best output resulted with a total cost of - 3674 and a gap of 0.49%, where all customer requests are met in the given time window. These results indicate that the optimization model developed in this study can yield the optimum solution for route planning mechanism and ready-mix concrete delivery scheduling.

Mass Rapid Transit (MRT) Jakarta is one of the new urban transportation in Greater Jakarta area which will be operated in early 2019. The development period has been started in 2010. A research has been conducted to determine its train specification, including train set and car number in 2010. Time revealed that the based data for that research, forecasted number of Jakarta population, is not fits the actual number. This research goal is to determine the train specification, which are the number of MRT Jakarta train set and number of car for each train set to reach its headway target by considering MRT Jakarta daily passenger target based on actual number of Jakarta population. The researcher uses ProModel 7.5 as the tool to simulate 12 optional policy. These 12 optional policies is made of combined three control variable, which are train set, car number, and headway. Researcher use the number of passenger compared to MRT Jakarta daily passenger target as the indicator to choose the best policy. Based on the result of this research, the best train specification policy that could reach the 5 minutes headway MRT Jakarta target is 7 train set and 6 cars for each set.

VRPTF is one of many various kinds of Vehicle Routing Problem (VRP) which is still slightly discussed. As logistic is always an issue for both developed and developing country, this research aims to compare whether or not VRPTF is suitably applied to logistic distribution in Indonesia. As we know, Indonesia is one of the archipelagic countries, so distributing goods across the island requires a high cost. The purpose of this paper is giving cost comparison by using VRPTF method, Hub-and-Spoke method, and Capacitated VRP method, so countries that may experience similar case can apply this method and get the optimize route model. This study was conducted by taking case study from a company that produces a non-perishable product and generate using Open Solver and VBA program, both in Excel. This research indicates that VRPTF method is giving optimize cost than other methods.