Germán Paredes-Belmar

Orcid: 0000-0002-5881-124X

According to our database1, Germán Paredes-Belmar authored at least 12 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Modeling and solving the two-level generalized median tour problem.
Comput. Oper. Res., 2024

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics.
IEEE Access, 2024

2023
A bi-objective time-dependent vehicle routing problem with delivery failure probabilities.
Comput. Ind. Eng., November, 2023

2022
Vehicle routing for milk collection with gradual blending: A case arising in Chile.
Eur. J. Oper. Res., 2022

2020
Multi-commodity inventory-location problem with two different review inventory control policies and modular stochastic capacity constraints.
Comput. Ind. Eng., 2020

The Generalized Median Tour Problem: Modeling, Solving and an Application.
IEEE Access, 2020

An Iterated Local Search Approach to Solve the Milk Collection Problem With Blending.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Solving the Feeder Vehicle Routing Problem using ant colony optimization.
Comput. Ind. Eng., 2019

A Prize Collecting problem applied to a Real Milk Collection problem in Chile.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018
Application of the ant colony optimization in the resolution of the bridge inspection routing problem.
Appl. Soft Comput., 2018

2017
The milk collection problem with blending and collection points.
Comput. Electron. Agric., 2017

2015
The maximin HAZMAT routing problem.
Eur. J. Oper. Res., 2015


  Loading...