Repositorio de Universidad Autónoma de Chile.
metadata only
Solving a distribution network design problem by means of evolutionary algorithms
In this paper a simple and efficient evolutionary algorithm is implemented to solve a Distribution Network Design problem (DND). The DND problem that we address here integrates inventory policies with location/allocation decision making. This problem, also known as Inventory Location Modeling proble
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimality of Random Regular Graphs in Sparse Network Designs#819396
- Optimality of Random Regular Graphs in Sparse Network Designs#809403
- A new paradigm for medical data circulation: research on medical data sharing based on evolutionary game theory.#351589
- Efficient Resizing and Topological Optimization of Real-World Water Distribution Networks in a Multi Criteria Decision-Making Framework#1025370
- Applications of graph theory in Optimization and Network Analysis#74045
Record · ID 947646
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive